graph library

Graph-theory objects and algorithms.

Classes

AStarSearchIterable<V>: Generalized A-Star search algorithm.
BreadthFirstIterable<V>: Iterable over the breadth-first traversal of vertices.
DepthFirstIterable<V>: Iterable over the depth-first traversal of vertices. The vertices are emitted pre-order, that is right when they are first discovered.
DepthFirstPostOrderIterable<V>: Iterable over the post-order depth-first traversal of vertices. The vertices are emitted post-order, that is after all its descendants have been discovered.
DijkstraSearchIterable<V>: Generalized Dijkstra's search algorithm.
Edge<V, E>: Abstract definition of an edge.
Graph<V, E>: Abstract base class of graphs.
GraphBuilder<V, E>
Path<V>: Abstract definition of a path.
RandomWalkIterable<V>: Iterable producing a random walk over a graph.
StorageStrategy<T>: Encapsulates data structures used for the various graph algorithms.
TopologicalIterable<V>: Iterable over the topological sorting of vertices. This traversal requires a predecessor-function, and ignores nodes that are part of cycles.

AtlasGraphBuilderExtension on GraphBuilder<V, E>
BreadthFirstGraphExtension on Graph<V, E>
CollectionGraphBuilderExtension on GraphBuilder<V, E>
CompleteGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/CompleteGraph.html
ConnectedGraphExtension on Graph<V, E>
DepthFirstGraphExtension on Graph<V, E>
DepthFirstPostOrderGraphExtension on Graph<V, E>
LogicalGraphExtension on Graph<V, E>
MapGraphExtension on Graph<V, E>
PartiteGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/Completek-PartiteGraph.html
PathGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/PathGraph.html
RandomGraphBuilderExtension on GraphBuilder<V, E>: Creates random graphs using different models.
RandomWalkGraphExtension on Graph<V, E>
ReversedEdgeExtension on Edge<V, E>
ReversedGraphExtension on Graph<V, E>
RingGraphBuilderExtension on GraphBuilder<V, E>
SearchGraphExtension on Graph<V, E>
StarGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/StarGraph.html
TopologicalGraphExtension on Graph<V, E>
TreeGraphBuilderExtension on GraphBuilder<V, E>: Creates m-ary trees (also known as n-ary, k-ary or k-way tree) in which each node has no more than m children.