NetworkX

Table Of Contents

Previous topic

networkx.average_clustering

Next topic

networkx.algorithms.components.connected.is_connected

Components

Connectivity

Connected components.

is_connected(G) Test graph connectivity
number_connected_components(G) Return number of connected components in graph.
connected_components(G) Return nodes in connected components of graph.
connected_component_subgraphs(G) Return connected components as subgraphs.
node_connected_component(G, n) Return nodes in connected components of graph containing node n.

Strong connectivity

Strongly connected components.

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) Return nodes in strongly connected components of graph.
strongly_connected_component_subgraphs(G) Return strongly connected components as subgraphs.
strongly_connected_components_recursive(G) Return nodes in strongly connected components of graph.
kosaraju_strongly_connected_components(G[, ...]) Return nodes in strongly connected components of graph.
condensation(G) Returns the condensation of G.

Weak connectivity

Weakly connected components.

is_weakly_connected(G) Test directed graph for weak connectivity.
number_weakly_connected_components(G) Return the number of connected components in G.
weakly_connected_components(G) Return weakly connected components of G.
weakly_connected_component_subgraphs(G) Return weakly connected components as subgraphs.

Atrracting components

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) Returns a list of attracting components in G.
attracting_component_subgraphs(G) Returns a list of attracting component subgraphs from G.