attracting_components
is_biconnected
Enter search terms or a module, class or function name.
Generates a list of attracting component subgraphs from \(G\).
G : DiGraph, MultiDiGraph
The graph to be analyzed.
subgraphs : list
A list of node-induced subgraphs of the attracting components of \(G\).
copy : bool
If copy is True, graph, node, and edge attributes are copied to the subgraphs.
See also
attracting_components, number_attracting_components, is_attracting_component