pub fn strongly_connected_components(
graph: &EinsumGraph,
) -> Vec<StronglyConnectedComponent>Expand description
Find all strongly connected components using Tarjan’s algorithm.
An SCC is a maximal set of nodes where every node is reachable from every other node. This is useful for detecting mutually dependent computations.