Figure 1
From: Analyzing fixed points of intracellular regulation networks with interrelated feedback topology
Division of vertices into strongly connected components. An example of a graph G(V ,E) and it’s partitioning into strongly connected components (left). Within a strongly connected component, each pair of vertices is connected via a path. If each SCC is contracted to a single vertex, the resulting graph is circuit-free (right) (if it contained circuits, the SCCs are not maximal, since all SCCs in the circuit could be merged to a larger SCC) and thus has a hierarchical order.