\brief Find a spanning tree (skipping irreducible edges). - Label pre and reverse-post orderings, tree, forward, cross, and back edges. - Calculate number of descendants. - Put the blocks of the graph in reverse post order. - Return an array of all nodes in pre-order. - If the graph does not have a real root, create one and return it, otherwise return null. Algorithm originally due to Tarjan. Th
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected