min_cost_matching_example.cc File Reference

Dedicated minimum-cost matching in general graphs. More...

#include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <Min_Cost_Matching.H>
#include <tpl_agraph.H>
#include <tpl_dynArray.H>
#include <tpl_dynSetTree.H>
#include <tpl_graph.H>
#include <tpl_sgraph.H>

Include dependency graph for min_cost_matching_example.cc:

Go to the source code of this file.

Functions
int	main ()

Detailed Description

Dedicated minimum-cost matching in general graphs.

Demonstrates:

• Dedicated API: blossom_minimum_cost_matching()
• Dedicated API: blossom_minimum_cost_perfect_matching()
• Objective modes:
  • pure minimum-cost
  • maximum-cardinality then minimum-cost
• Perfect matching feasibility reporting
• Same result across List/SGraph/Array Aleph graph backends

Build and run:

cmake -S . -B build cmake –build build –target min_cost_matching_example ./build/Examples/min_cost_matching_example

Definition in file min_cost_matching_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 321 of file min_cost_matching_example.cc.

References Aleph::divide_and_conquer_partition_dp().