Home
last modified time | relevance | path

Searched refs:DisjointSetForest (Results 1 – 4 of 4) sorted by relevance

/dports/science/cdk/cdk-cdk-2.3/base/test-standard/src/test/java/org/openscience/cdk/group/
H A DDisjointSetForestTest.java40 DisjointSetForest forest = new DisjointSetForest(n); in constructorTest()
47 DisjointSetForest forest = new DisjointSetForest(n); in getTest()
56 DisjointSetForest forest = new DisjointSetForest(n); in getRootTest()
64 DisjointSetForest forest = new DisjointSetForest(n); in makeUnionTest()
72 DisjointSetForest forest = new DisjointSetForest(n); in getSetsTest()
/dports/science/cdk/cdk-cdk-2.3/base/standard/src/main/java/org/openscience/cdk/graph/
H A DEdmondsMaximumMatching.java27 import org.openscience.cdk.group.DisjointSetForest;
75 private DisjointSetForest dsf;
109 this.dsf = new DisjointSetForest(graph.length); in EdmondsMaximumMatching()
132 dsf = new DisjointSetForest(graph.length); in augment()
/dports/science/cdk/cdk-cdk-2.3/base/standard/src/main/java/org/openscience/cdk/group/
H A DDisjointSetForest.java36 public class DisjointSetForest { class
50 public DisjointSetForest(int numberOfElements) { in DisjointSetForest() method in DisjointSetForest
/dports/science/cdk/cdk-cdk-2.3/tool/group/src/main/java/org/openscience/cdk/group/
H A DAbstractDiscretePartitionRefiner.java131 final DisjointSetForest forest = new DisjointSetForest(n); in getAutomorphismPartition()