SPARGEL
An opensource Java graph library. Abandoned, ignore.
...Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap.
Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are:
* Adjecency graph data structures
* Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components
* Creating sub graphs, vertice and edge maps that use a function to implement their mapping.
Spargel is released under GPLv3