Graph of the Strongly Connected Components
Ain 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. Note that GINsim also provides dedicated to this problem.
Generate SCC Graphs
Analyse SCC Graphs
Like other, SCC graphs can be saved in the or formats. They can also be exported to the .