Module org.jgrapht.core
Package org.jgrapht.alg.matching.blossom.v5
package org.jgrapht.alg.matching.blossom.v5
Package for Kolmogorov's Blossom V algorithm
-
ClassDescriptionBlossomVDualUpdater<V,
E> This class is used byKolmogorovWeightedPerfectMatchingto 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.BlossomVInitializer<V,E> Is used to start the Kolmogorov's Blossom V algorithm.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.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 byKolmogorovWeightedPerfectMatchingfor performing primal operations: grow, augment, shrink and expand.BlossomVState<V,E> This class stores data needed for the Kolmogorov's Blossom V algorithm; it is used byKolmogorovWeightedPerfectMatching,BlossomVPrimalUpdaterandBlossomVDualUpdaterduring the course of the algorithm.This class is a data structure for Kolmogorov's Blossom V algorithm.An iterator over tree nodes.This class is a data structure for Kolmogorov's Blossom V algorithm.This class computes weighted matchings in general graphs.This class computes weighted perfect matchings in general graphs using the Blossom V algorithm.A solution to the dual linear program formulated on thegraphDescribes 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.