Got Floyd-Warshall algorithm tested with FewestNodes
Now storing Nodes in a Vector
Think I've got successors and predecessors working
Got Dijkstra's algorithm working
A lot of refactoring while bringing in AllPathsFirstSteps
Lots of refactoring to get AllPairsFirstFirstSteps set up
Replaced all v1s with v0.0.0
Got Brandes' algorithm working
Added the new kit to the timing study and started learning from the profiler.
Work with a profiler
Found one more potential speedup in FastDigraph
Looks like I need less graph inside of dijkstra's algorithm.
Moved relax() to digraph
Found the bug in AllPathsFirstStep and got Dijkstra's working in a more pure form.
Some cleanup
Dijkstras now returning an edge list
Added a custom equals method, squeezed out 4%
Tweaked the heap for about 15%
Now running a big timing study
Tweaked FirstSteps equals to short-circuit when a reference is compared with itself. A bit faster.