Components¶
Connectivity¶
is_connected (G) |
Return True if the graph is connected, False otherwise. |
number_connected_components (G) |
Return the number of connected components. |
connected_components (G) |
Generate connected components. |
connected_component_subgraphs (G[, copy]) |
DEPRECATED: Use (G.subgraph(c) for c in connected_components(G)) |
node_connected_component (G, n) |
Return the set of nodes in the component of graph containing node n. |
Strong connectivity¶
is_strongly_connected (G) |
Test directed graph for strong connectivity. |
number_strongly_connected_components (G) |
Return number of strongly connected components in graph. |
strongly_connected_components (G) |
Generate nodes in strongly connected components of graph. |
strongly_connected_component_subgraphs (G[, copy]) |
DEPRECATED: Use (G.subgraph(c) for c in strongly_connected_components(G)) |
strongly_connected_components_recursive (G) |
Generate nodes in strongly connected components of graph. |
kosaraju_strongly_connected_components (G[, …]) |
Generate nodes in strongly connected components of graph. |
condensation (G[, scc]) |
Returns the condensation of G. |
Weak connectivity¶
is_weakly_connected (G) |
Test directed graph for weak connectivity. |
number_weakly_connected_components (G) |
Return the number of weakly connected components in G. |
weakly_connected_components (G) |
Generate weakly connected components of G. |
weakly_connected_component_subgraphs (G[, copy]) |
DEPRECATED: Use (G.subgraph(c) for c in weakly_connected_components(G)) |
Attracting components¶
is_attracting_component (G) |
Returns True if G consists of a single attracting component. |
number_attracting_components (G) |
Returns the number of attracting components in G . |
attracting_components (G) |
Generates the attracting components in G . |
attracting_component_subgraphs (G[, copy]) |
DEPRECATED: Use (G.subgraph(c) for c in attracting_components(G)) |
Biconnected components¶
is_biconnected (G) |
Return True if the graph is biconnected, False otherwise. |
biconnected_components (G) |
Return a generator of sets of nodes, one set for each biconnected |
biconnected_component_edges (G) |
Return a generator of lists of edges, one list for each biconnected component of the input graph. |
biconnected_component_subgraphs (G[, copy]) |
DEPRECATED: Use (G.subgraph(c) for c in biconnected_components(G)) |
articulation_points (G) |
Yield the articulation points, or cut vertices, of a graph. |
Semiconnectedness¶
is_semiconnected (G) |
Return True if the graph is semiconnected, False otherwise. |