Renamed edges to arcs, and started building out the graph hierarchy to match wikipedia's definitions
About halfway through updating the readme.md
Updated readme to match the big API change.
Added test of converting from scala-graph
Got a multiversion build working. Easy.
Some renaming to separate arcs from labels
Brandes seems to give the same result for directed graphs as Jung's betweenness
Got a test of Brandes that works with 33 arcs, fails with 34
Fixed Brandes algorithm. Imagine my chagrin.
bunch of refactoring
Before figuring out how to get an inner edge collection with a reference to the containing digraph
Added some notes on efficiency
Added code to build subgraphs for AllPaths
Gave Brandes its own SemiringSupport
Separated out a special semiring for Brandes' algorithm
Switched to using indexes in Brandes algorith
Now finding the partial betweennesses in O(a)
Switched over to use Brandes' special semiring
Cleaning up some todos
Renaming before breakign up LabelDigraph.scala