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>
private static class SparseEdmondsMaximumCardinalityMatching.VertexPartition extends java.lang.Object
Special integer vertex union-find.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private static class
SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
-
Field Summary
Fields Modifier and Type Field Description private SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item[]
items
-
Constructor Summary
Constructors Constructor Description VertexPartition(int n)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
find(int e)
private SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
findItem(int e)
void
name(int e)
Name the representative of the group where e belongs as e.void
split(java.util.List<java.lang.Integer> toSplit)
Split a partition.void
union(int a, int b)
-
-
-
Field Detail
-
items
private SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item[] items
-
-
Method Detail
-
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
public void split(java.util.List<java.lang.Integer> toSplit)
Split a partition. Assumes that it contains all members, otherwise bad things may happen.- Parameters:
toSplit
- all members of a partition
-
findItem
private SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item findItem(int e)
-
-