Class SparseEdmondsMaximumCardinalityMatching.VertexPartition

java.lang.Object
org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
Enclosing class:
SparseEdmondsMaximumCardinalityMatching<V,E>
private static class SparseEdmondsMaximumCardinalityMatching.VertexPartition extends Object
Special integer vertex union-find.

  • Field Details

  • 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

      public void split(List<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)