Module org.jgrapht.core
Package org.jgrapht.alg.matching
Class SparseEdmondsMaximumCardinalityMatching.Algorithm<V,E>
java.lang.Object
org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm<V,E>
- Type Parameters:
V
- the vertex typeE
- the edge type
- Enclosing class:
SparseEdmondsMaximumCardinalityMatching<V,
E>
The actual implementation as an inner class. We use this pattern in order to free the work
memory after computation. The outer class can cache the result but can also release all the
auxiliary memory.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprivate static enum
Even, odd and unlabeled labels. -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate MatchingAlgorithm
<V, E> private int[]
private int
private static final int
private double[]
private double[]
private int[]
private FixedSizeIntegerQueue
private int[]
(package private) double
private int[]
private V[]
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprivate void
private void
private void
private void
shrinkPath
(int b, int v, int w)
-
Field Details
-
NULL
private static final int NULL- See Also:
-
graph
-
initializer
-
nodes
private int nodes -
vertexIndexMap
-
vertexMap
-
mate
private int[] mate -
label
-
pred
private int[] pred -
strue
double strue -
path1
private double[] path1 -
path2
private double[] path2 -
sourceBridge
private int[] sourceBridge -
targetBridge
private int[] targetBridge -
base
-
queue
-
labeledNodes
-
-
Constructor Details
-
Algorithm
-
-
Method Details
-
initialize
private void initialize() -
runInitializer
private void runInitializer() -
findPath
-
shrinkPath
private void shrinkPath(int b, int v, int w) -
computeMatching
-
computeOddSetCover
-