Module rustworkx_core::connectivity

Module for connectivity and cut algorithms.

Functions

• all_simple_paths_multiple_targets
  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.
• articulation_points
  Return the articulation points of an undirected graph.
• bfs_undirected
  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.
• chain_decomposition
  Returns the chain decomposition of a graph.
• connected_components
  Given a graph, return a list of sets of all the connected components.
• core_number
  Return the core number for each node in the graph.
• cycle_basis
  Return a list of cycles which form a basis for cycles of a given graph.
• find_cycle
  Return the first cycle encountered during DFS of a given directed graph. Empty list is returned if no cycle is found.
• longest_simple_path_multiple_targets
  Returns the longest of all the 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.
• number_connected_components
  Given a graph, return the number of connected components of the graph.
• stoer_wagner_min_cut
  Stoer-Wagner’s min cut algorithm.