Some common methods and algorithms that are not specific to a graph data structure implementation.
Finds all weakly connected components of the graph.
Graph data structure to use.
The weakly connected components of the given graph.
Returns an iterator over the given vertices predecessors and successors, in that order.
A graph data structure.
Vertex whose predecessors and successors are fetched.
The vertex's predecessors and successors in that order.
Generated using TypeDoc