Dijkstar
++++++++
Dijkstar is an implementation of Dijkstra's single-source shortest-paths
algorithm. If a destination node is given, the algorithm halts when that node
is reached; otherwise it continues until paths to all nodes are found.
Accepts an optional weighting function that will be called on every iteration.
Also accepts an optional heuristic function that is used to push the algorithm
toward a destination instead of fanning out in every direction. Using such a
heuristic function converts Dijkstra to A* (and this is where the name
"Dijkstar" comes from).
Performance is decent on a graph with 100,000+ nodes. Runs in ...