networkx.algorithms.components.attracting_component_subgraphs¶
-
attracting_component_subgraphs
(G, copy=True)[source]¶ Generates a list of attracting component subgraphs from
G
.Parameters: G (DiGraph, MultiDiGraph) – The graph to be analyzed. Returns: - 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.
Raises: NetworkXNotImplemented : – If the input graph is undirected. - subgraphs (list) – A list of node-induced subgraphs of the attracting components of