Up – Package index » Fix: Memoization and Fixed Points Made Easy » Library fix » Fix » SCC

Module `Fix.SCC`Source

This module provides an implementation of Tarjan's algorithm, which computes the strongly connected components of a directed graph.

Sourcemodule Run (G : sig ... end) : sig ... end

The algorithm runs when Run(G) is called. The time complexity of the computation is $O(V+E)$ , where $V$ is the number of vertices of the graph G and $E$ is the number of its edges.