BlossomVOptions that define the strategies to use during the algorithm for updating duals and initializing the matching
This class computes a minimum weight perfect matching in general graphs using the Blossom V algorithm.
A solution to the dual linear program formulated on the
Describes the performance characteristics of the algorithm and numeric data about the number of performed dual operations during the main phase of the algorithm
Enum for choosing dual updates strategy
Enum for types of matching initialization
Copyright © 2018. All rights reserved.