NetworkX

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. |

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[, scc]) |
Returns the condensation of G. |

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. |

Attracting components.

is_attracting_component(G) |
Returns True if consists of a single attracting component. |

number_attracting_components(G) |
Returns the number of attracting components in . |

attracting_components(G) |
Returns a list of attracting components in . |

attracting_component_subgraphs(G) |
Returns a list of attracting component subgraphs from . |

Biconnected components and articulation points.

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) |
Return a generator of graphs, one graph for each biconnected component of the input graph. |

articulation_points(G) |
Return a generator of articulation points, or cut vertices, of a graph. |