úÎö Traversal stack Next node number Finished SCCs Next SCC number The original graph +Index in DFS traversal, or SCC for vertex.  Legend for the index array:  0: Node not visited 5 -ve: Node is on the stack with the given number 8 +ve: Node belongs to the SCC with the given number Least reachable node State BComputes the strongly connected components (SCCs) of the graph in  O(edges + /vertices) time. The resulting tuple contains: 5 * A (reversed) topologically sorted list of SCCs. 7 Each SCCs is assigned a unique identifier of type  . K * An O(1) mapping from vertices in the original graph to the identifier / of their SCC. This mapping will raise an  out of bounds F exception if it is applied to integers that do not correspond to " vertices in the input graph. EThis function assumes that the adjacency lists in the original graph E mention only nodes that are in the graph. Violating this assumption  will result in  out of bounds array exception. >Compute the list of strongly connected components of a graph. * The components are topologically sorted: J if v1 in C1 points to v2 in C2, then C2 will come before C1 in the list. >Compute the list of strongly connected components of a graph. L Each component contains the adjecency information from the original graph. * The components are topologically sorted: J if v1 in C1 points to v2 in C2, then C2 will come before C1 in the list. >Quotient a graph with the relation that relates vertices that @ belong to the same SCC. The vertices in the new graph are the E SCCs of the old graph, and there is an edge between two components, 4 if there is an edge between any of their vertices. I The entries in the resulting list are in reversed-topologically sorted: J if v1 in C1 points to v2 in C2, then C1 will come before C2 in the list.        GraphSCC-1.0Data.Graph.SCCData.Graph.ArraySCCsccsccListsccListRsccGraphstronglyConnCompstronglyConnCompRSstacknumsccsnext_sccFuncghc-prim GHC.TypesIntroots from_root check_adjto_scc