pub fn extract_largest_component<T, S>(
graph: &S,
directed: bool,
connection: &str,
) -> SparseResult<(S, Vec<usize>)>
Expand description
Extract a subgraph containing only the largest connected component
§Arguments
graph
- The original graph as a sparse matrixdirected
- Whether the graph is directedconnection
- Type of connectivity for directed graphs
§Returns
A tuple containing:
- The subgraph as a sparse matrix
- Mapping from new vertex indices to original vertex indices