| BlossomVDualUpdater |
|
| BlossomVEdge |
This class is a data structure for Kolmogorov's Blossom V algorithm.
|
| BlossomVEdge.BlossomNodesIterator |
An iterator which traverses all nodes in the blossom.
|
| BlossomVInitializer.Action |
Enum for specifying the primal operation to perform with critical edge during fractional
matching initialization
|
| BlossomVNode |
This class is a data structure for Kolmogorov's Blossom V algorithm.
|
| BlossomVNode.IncidentEdgeIterator |
An iterator for traversing the edges incident to this node.
|
| BlossomVNode.Label |
Represents nodes' labels
|
| BlossomVOptions |
BlossomVOptions that define the strategies to use during the algorithm for updating duals and
initializing the matching
|
| BlossomVOptions.DualUpdateStrategy |
Enum for choosing dual updates strategy
|
| BlossomVOptions.InitializationType |
Enum for types of matching initialization
|
| BlossomVPrimalUpdater |
|
| BlossomVState |
|
| BlossomVTree |
This class is a data structure for Kolmogorov's Blossom V algorithm.
|
| BlossomVTree.TreeEdgeIterator |
An iterator over tree edges incident to this tree.
|
| BlossomVTree.TreeNodeIterator |
An iterator over tree nodes.
|
| BlossomVTreeEdge |
This class is a data structure for Kolmogorov's Blossom V algorithm.
|
| KolmogorovWeightedPerfectMatching |
This class computes weighted perfect matchings in general graphs using the Blossom V algorithm.
|
| KolmogorovWeightedPerfectMatching.DualSolution |
A solution to the dual linear program formulated on the graph
|
| KolmogorovWeightedPerfectMatching.Statistics |
Describes the performance characteristics of the algorithm and numeric data about the number
of performed dual operations during the main phase of the algorithm
|
| ObjectiveSense |
Enum specifying the objective sense of the algorithm.
|