pub fn strongly_connected_components<T, S>( graph: &S, returnlabels: bool, ) -> SparseResult<(usize, Option<Array1<usize>>)>where T: Float + Debug + Copy + 'static, S: SparseArray<T>,
Find strongly connected components in a directed graph using Tarjan’s algorithm