Class SparseEdmondsMaximumCardinalityMatching.Algorithm<V,E>

java.lang.Object
org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm<V,E>
Type Parameters:
V - the vertex type
E - the edge type
Enclosing class:
SparseEdmondsMaximumCardinalityMatching<V,E>

private static class SparseEdmondsMaximumCardinalityMatching.Algorithm<V,E> extends Object
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.