Module org.jgrapht.core
Package org.jgrapht.alg.matching
Class SparseEdmondsMaximumCardinalityMatching.VertexPartition
java.lang.Object
org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- Enclosing class:
SparseEdmondsMaximumCardinalityMatching<V,
E>
Special integer vertex union-find.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprivate static class
-
Field Summary
FieldsModifier and TypeFieldDescription -
Constructor Summary
Constructors -
Method Summary
-
Field Details
-
items
-
-
Constructor Details
-
VertexPartition
public VertexPartition(int n)
-
-
Method Details
-
find
public int find(int e) -
union
public void union(int a, int b) -
name
public void name(int e) Name the representative of the group where e belongs as e.- Parameters:
e
- a vertex
-
split
Split a partition. Assumes that it contains all members, otherwise bad things may happen.- Parameters:
toSplit
- all members of a partition
-
findItem
-