{"push_id":848324854,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b568c48e7694b24562282ac3662bcc42e081d19d","before":"f8eb169a059f612aa65d125252d9f5bfa536ba53","commits":[{"sha":"b568c48e7694b24562282ac3662bcc42e081d19d","author":{"email":"c4152259d01449dbb5255c14734f0fae9841e99e@udallas.edu","name":"Brian McCutchon"},"message":"Optimize \"Word Ladder\"\n\nWord Ladder no longer times out, but now gets “Wrong Answer.”\n\nApparently, removing an element from a Java PriorityQueue is O(n), and\nthere’s no nice way to update an element on the queue. Instead, to\nimplement Dijkstra, you can just put something on the queue twice. The\nsecond time you pop it off, just throw it away.","distinct":true,"url":"https://api.github.com/repos/Vendea/Programming-Team/commits/b568c48e7694b24562282ac3662bcc42e081d19d"}]}