2 Commits

Author	SHA1	Message	Date
Olaoluwa Osuntokun	9f96ceb1e0	routing: introduce new heap for storing candidate shortest paths ... This commit adds a new heap structure to heap.go which will be used for storing candidate paths during the iterations of the k-shortest paths algorithm.	2017-03-21 12:20:30 -07:00
Olaoluwa Osuntokun	606b23df43	routing: introduce a heap to keep track of closest nodes during pathfinding ... This commit introduces a new heap struct that will be used to keep track of the next closest node to the source during path finding within our modified Dijkstra's algorithm.	2017-03-21 12:20:18 -07:00