fn strong_connect(graph: &mut Graph, position: Point) -> usize
Tarjan’s algorithm to find strongly connected components, e.g. cycles in a directed graph.