Maximum weight matching algorithms

benchmark/CMakeLists.txt

@@ -27,3 +27,13 @@ koala_make_benchmark(
     benchmark_independent_set
     benchmarkIndependentSet.cpp
     benchmarkIndependentSet.sh)
+
+koala_make_benchmark(
+    benchmark_maximum_matching
+    benchmarkMaximumMatching.cpp
+    benchmarkMaximumMatching.sh)
+
+koala_make_benchmark(
+    benchmark_mv
+    benchmarkMicaliVazirani.cpp
+    benchmarkMicaliVazirani.sh)

benchmark/benchmarkMaximumMatching.cpp

@@ -0,0 +1,50 @@
+#include <cassert>
+#include <filesystem>
+#include <iostream>
+
+#include <matching/MaximumMatching.hpp>
+#include <io/DimacsGraphReader.hpp>
+
+int main(int argc, char **argv) {
+    if (argc < 3) {
+        std::cout << "Usage: " << argv[0] << " algorithm filename" << std::endl;
+        return 1;
+    }
+    std::string algorithm(argv[1]);
+    std::string path(argv[2]);
+    if (!std::filesystem::exists(path)) {
+        std::cout << "File " << path << " does not exist" << std::endl;
+        return 1;
+    }
+    auto G = Koala::DimacsGraphReader().read(path);
+    G.indexEdges(true);
+    Koala::MaximumWeightMatching* maximum_matching;
+    if (algorithm == "edmonds") {
+        maximum_matching = new Koala::EdmondsMaximumMatching(G);
+    } else if (algorithm == "gabow") {
+        maximum_matching = new Koala::GabowMaximumMatching(G);
+    } else if (algorithm == "micali") {
+        maximum_matching = new Koala::GalilMicaliGabowMaximumMatching(G);
+    } else if (algorithm == "scaling") {
+        maximum_matching = new Koala::GabowScalingMatching(G);
+    } else {
+        std::cout << "Unknown algorithm: " << algorithm << std::endl;
+        return 1;
+    }
+    maximum_matching->run();
+    auto matching = maximum_matching->getMatching();
+    int weight = 0;
+    for (auto [u, v] : matching) {
+        std::cout << u << " " << v << std::endl;
+        if (v != NetworKit::none) {
+            assert(matching[v] == u);
+            assert(G.hasEdge(u, v));
+
+            weight += static_cast<int>(G.weight(u, v));
+        }
+    }
+    std::cout << weight / 2 << std::endl;
+
+    delete maximum_matching;
+    return 0;
+}

benchmark/benchmarkMaximumMatching.sh

@@ -0,0 +1 @@
+echo "benchmarkMaximumMatching.sh $@"

benchmark/benchmarkMicaliVazirani.cpp

@@ -0,0 +1,32 @@
+#include <cassert>
+#include <filesystem>
+#include <iostream>
+
+#include <matching/MaximumMatching.hpp>
+#include <io/DimacsGraphReader.hpp>
+
+int main(int argc, char **argv) {
+    if (argc < 2) {
+        std::cout << "Usage: " << argv[0] << " filename" << std::endl;
+        return 1;
+    }
+    std::string path(argv[1]);
+    if (!std::filesystem::exists(path)) {
+        std::cout << "File " << path << " does not exist" << std::endl;
+        return 1;
+    }
+    auto G = Koala::DimacsGraphReader().read(path);
+    G.indexEdges(true);
+    Koala::MicaliVaziraniMatching MVmatching(G); 
+    MVmatching.run();
+    auto matching = MVmatching.getMatching();
+    int size = 0;
+    for (auto [u, v] : matching) {
+        std::cout << u << " " << v << std::endl;
+        if (v != NetworKit::none && u < v)
+            size ++;
+    }
+    std::cout << size << std::endl;
+
+    return 0;
+}

benchmark/benchmarkMicaliVazirani.sh

@@ -0,0 +1 @@
+echo "benchmarkMicaliVazirani.sh $@"

cpp/CMakeLists.txt

@@ -8,3 +8,4 @@ add_subdirectory(mst)
 add_subdirectory(recognition)
 add_subdirectory(set_cover)
 add_subdirectory(traversal)
+add_subdirectory(matching)