Expand description
Connected components analysis for sparse graphs
This module provides efficient algorithms for finding connected components in sparse graphs represented as matrices.
Functions§
- connected_
components - Find connected components in a graph
- extract_
largest_ component - Extract a subgraph containing only the largest connected component
- is_
connected - Check if a graph is connected
- largest_
component - Find the largest connected component
- strongly_
connected_ components - Find strongly connected components in a directed graph using Tarjan’s algorithm
- undirected_
connected_ components - Find connected components in an undirected graph using DFS
- weakly_
connected_ components - Find weakly connected components in a directed graph