Uses of Package
org.jgrapht.alg.matching.blossom.v5
Packages that use org.jgrapht.alg.matching.blossom.v5
Package
Description
Package for Kolmogorov's Blossom V algorithm
-
Classes in org.jgrapht.alg.matching.blossom.v5 used by org.jgrapht.alg.matching.blossom.v5ClassDescriptionThis class is used by
KolmogorovWeightedPerfectMatching
to perform dual updates, thus increasing the dual objective function value and creating new tight edges.This class is a data structure for Kolmogorov's Blossom V algorithm.An iterator which traverses all nodes in the blossom.Enum for specifying the primal operation to perform with critical edge during fractional matching initializationThis class is a data structure for Kolmogorov's Blossom V algorithm.An iterator for traversing the edges incident to this node.Represents nodes' labelsBlossomVOptions that define the strategies to use during the algorithm for updating duals and initializing the matchingEnum for choosing dual updates strategyEnum for types of matching initializationThis class is used byKolmogorovWeightedPerfectMatching
for performing primal operations: grow, augment, shrink and expand.This class stores data needed for the Kolmogorov's Blossom V algorithm; it is used byKolmogorovWeightedPerfectMatching
,BlossomVPrimalUpdater
andBlossomVDualUpdater
during the course of the algorithm.This class is a data structure for Kolmogorov's Blossom V algorithm.An iterator over tree edges incident to this tree.An iterator over tree nodes.This class is a data structure for Kolmogorov's Blossom V algorithm.This class computes weighted perfect matchings in general graphs using the Blossom V algorithm.A solution to the dual linear program formulated on thegraph
Describes the performance characteristics of the algorithm and numeric data about the number of performed dual operations during the main phase of the algorithmEnum specifying the objective sense of the algorithm.