Module rustworkx_core::connectivity
source · [−]Expand description
Module for connectivity and cut algorithms.
Functions
Returns a dictionary with all simple paths from
from node to all nodes in to, which contains at least min_intermediate_nodes nodes
and at most max_intermediate_nodes, if given, or limited by the graph’s order otherwise. The simple path is a path without repetitions.Return the articulation points of an undirected graph.
Given an graph, a node in the graph, and a visit_map,
return the set of nodes connected to the given node
using breadth first search and treating all edges
as undirected.
Returns the chain decomposition of a graph.
Given a graph, return a list of sets of all the
connected components.
Given a graph, return the number of connected components of the graph.
Stoer-Wagner’s min cut algorithm.