{"action":"opened","issue":{"url":"https://api.github.com/repos/Bradfield/algos/issues/72","repository_url":"https://api.github.com/repos/Bradfield/algos","labels_url":"https://api.github.com/repos/Bradfield/algos/issues/72/labels{/name}","comments_url":"https://api.github.com/repos/Bradfield/algos/issues/72/comments","events_url":"https://api.github.com/repos/Bradfield/algos/issues/72/events","html_url":"https://github.com/Bradfield/algos/issues/72","id":300117867,"number":72,"title":"Dijkstra's algorithm implementation is wrong in heapq usage","user":{"login":"qianzhang42","id":6611641,"avatar_url":"https://avatars2.githubusercontent.com/u/6611641?v=4","gravatar_id":"","url":"https://api.github.com/users/qianzhang42","html_url":"https://github.com/qianzhang42","followers_url":"https://api.github.com/users/qianzhang42/followers","following_url":"https://api.github.com/users/qianzhang42/following{/other_user}","gists_url":"https://api.github.com/users/qianzhang42/gists{/gist_id}","starred_url":"https://api.github.com/users/qianzhang42/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/qianzhang42/subscriptions","organizations_url":"https://api.github.com/users/qianzhang42/orgs","repos_url":"https://api.github.com/users/qianzhang42/repos","events_url":"https://api.github.com/users/qianzhang42/events{/privacy}","received_events_url":"https://api.github.com/users/qianzhang42/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-02-26T05:54:07Z","updated_at":"2018-02-26T05:54:07Z","closed_at":null,"author_association":"NONE","body":"In \"Shortest Path with Dijkstra’s Algorithm\", the implementation used \"entry_lookup[neighbor][0] = distance\" to change entry value in heap. \r\n\r\nThis will not work because heap will not reorganize after this modification. One correct way to reorganize this heap is using heapq._siftdown function. You can find some reference [here](http://code.activestate.com/recipes/577892-dijkstra-shortest-path-implementation/)."}}
{"actor":{"display_login":"qianzhang42"}}