tarjan : Ord cuid => SortedMap cuid (SortedSet cuid) -> List (List1 cuid)Find strongly connected components in the given graph.
Input: map from vertex X to all vertices Y such that there is edge X->Y
Output: list of strongly connected components, ordered by output degree descending