java.lang.Object
org.maxicp.cp.engine.constraints.SCC
-
Constructor Details
-
SCC
public SCC(int numNodes) This class implements Tarjan's algorithm to find strongly connected components (SCCs) in a directed graph. It uses depth-first search (DFS) to discover SCCs and assigns each node to its corresponding SCC.- Parameters:
numNodes- The number of nodes in the graph.
-
-
Method Details
-
findSCC
public void findSCC(int[][] adjacencyMatrix) -
getSccByNode
public int[] getSccByNode() -
getNumSCC
public int getNumSCC()
-