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ยง
- decompose_
strongly_ connected_ components - Returns the strongly connected components of a graph.
- decompose_
strongly_ connected_ components_ non_ consecutive - Returns the strongly connected components of a graph whose indices are non-consecutive.
- decompose_
weakly_ connected_ components - Returns the weakly connected components of a graph.
- decompose_
weakly_ connected_ components_ with_ mappings - Returns the weakly connected components of a graph.
- extract_
subgraphs_ from_ node_ mapping - Extract the subgraphs of the given graph according to the given node_mapping.
- is_
cycle - Returns true if the given graph is a cycle.
- is_
strong_ bridge - 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.
- is_
strongly_ connected - Returns true if the graph is strongly connected.
- naively_
compute_ strong_ bridges - Compute the strong bridges of the graph with a naive O(m^2) algorithm. Note that this function assumes that the graph is strongly connected, and returns all edges otherwise.