max/edmonds-matching-algorithm
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

call matching algorithm in main method

Browse source
This commit is contained in:
Maximilian Keßler 2023-11-04 18:55:12 +01:00
parent 0131c31c74
commit bdc5798eed
Signed by: max
GPG key ID: BCC5A619923C0BA5
1 changed files with 5 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
example.cpp
View file

@ -2,6 +2,7 @@
#include <fstream> // For reading input files. #include <fstream> // For reading input files.
#include "graph.hpp" #include "graph.hpp"
#include "edmonds.h"
int main(int argc, char** argv) int main(int argc, char** argv)
{ {
@ -29,7 +30,10 @@ int main(int argc, char** argv)
} }
} }
} }
std::cout << greedy_matching_as_graph;
// Now, calculate the matching
ED::Graph optimum_matching = Edmonds::maximum_matching(greedy_matching_as_graph);
std::cout << optimum_matching;
return EXIT_SUCCESS; return EXIT_SUCCESS;
} }