Module traitgraph::algo::components [−][src]
Expand description
Algorithms related to graph components, i.e. finding the strongly or weakly connected components of a graph or checking if a graph is strongly connected.
Functions
Returns the strongly connected components of a graph.
Returns the weakly connected components of a graph.
Extract the subgraphs of the given graph according to the given node_mapping.
Returns true if the given graph is a cycle.
Returns true if the given edge is a strong bridge. Note that this function assumes that the graph is strongly connected, and always returns true otherwise.
Returns true if the graph is strongly connected.