{"repository":{"description":"This project implements Dijkstra's shortest path algorithm using three different schemes: 1. simple scheme without using any complex data structure; 2. Binomial heap; 3. Fibonacci heap.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":198,"owner":"minchenufl","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2013-07-23T07:32:01-07:00","pushed_at":"2013-08-13T13:11:15-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Min Chen","company":"University of Florida","blog":"www.cise.ufl.edu/~min","location":"Gainesville, Fl","email":"8a8987ab34fa21bfd6c5173352cdb174c280a2db@gmail.com"},"url":"https://github.com/minchenufl/Dijsktra--Algorithm/compare/fb897de13d...e44d5aec72"}