# Graph of the Strongly Connected Components

A Strongly Connected Component (SCC) in a graph is a maximal subgraph such that all its components are strongly connected. Each SCC can either a single node or a set of intertwined cycles of the original graph. The SCC graph is a derived graph in which each node represent one of the SCC of the original graph. This acyclic graph provides a simplified representation of the organisation of the original graph. This graph is thus often much more compact.

In GINsim, the SCC graph is often used to provide a better understanding of the organisation of the attractors in a State Transition Graph. Note that GINsim also provides Hierarchical Transition Graphs dedicated to this problem.

## Generate SCC Graphs

## Analyse SCC Graphs

## Formats

Like other graphs, SCC graphs can be saved in the GINML or Z-GINML formats. They can also be exported to the common graph formats.