Package jenkins.util

Class DirectedGraph.SCC<N>

    • Field Detail

      • index

        public final int index
        The Tarjan's algorithm is such that this index constitutes the reverse topological order of the topological sort of the SCC DAG.

        That is, if you think about a derived graph where nodes are SCCs of the original directed graph, it will always form a DAG even when the original graph has cycles. Smallest SCC# means it's more of a sink, and larger SCC# means it's more of a source.

    • Constructor Detail

      • SCC

        public SCC​(int index)