Class SCC<V>
java.lang.Object
tools.refinery.interpreter.rete.itc.alg.misc.scc.SCC<V>
- Type Parameters:
V
- the type parameter of the nodes in the graph
Efficient algorithms to compute the Strongly Connected Components in a directed graph.
-
Field Summary
Fields -
Method Summary
Modifier and TypeMethodDescriptionstatic <V> SCCResult
<V> computeSCC
(IGraphDataSource<V> g) Computes the SCCs for the given graph and returns them as a multiset.
-
Field Details
-
sccId
public static long sccId
-
-
Method Details
-
computeSCC
Computes the SCCs for the given graph and returns them as a multiset. (Iterative version of Tarjan's algorithm)- Parameters:
g
- the directed graph data source- Returns:
- the set of SCCs
-