public static class DirectedGraph.SCC<N> extends AbstractSet<N>
Modifier and Type | Field and Description |
---|---|
int |
index
The Tarjan's algorithm is such that this index constitutes
the reverse topological order of the topological sort of the SCC DAG.
|
Constructor and Description |
---|
SCC(int index) |
Modifier and Type | Method and Description |
---|---|
Iterator<N> |
iterator() |
int |
size() |
equals, hashCode, removeAll
add, addAll, clear, contains, containsAll, isEmpty, remove, retainAll, toArray, toArray, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
add, addAll, clear, contains, containsAll, isEmpty, remove, retainAll, spliterator, toArray, toArray
parallelStream, removeIf, stream
public final int index
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.
Copyright © 2018. All rights reserved.