Interface | Description |
---|---|
Graph<V> | |
UndirectedGraph<V> |
Class | Description |
---|---|
Cliques |
"Solve" the clique problem, but polynomially on arbitrary graphs.
|
Components<V> | |
ConnectedComponents<V> | |
ConnectedComponents2 |
New implementation of connected components.
|
EdgeIterable | |
GraphFactory | |
GraphImplLinearEdge<V> | |
GraphImplLinearEdgeImportOptimised<V> | |
GraphImplQuadratic<V> | |
LongBitSet |
Obtained from http://java-performance.info/bit-sets/
|
Reachability | |
StronglyConnectedComponents<X> | |
UndirectedSimpleGraph<V> |
No self-edges, no arc weights.
|