blossom

Implementations and tests of the blossom algorithm for matching in general graphs.

Algorithm (1) "The Blossom Algorithm" - match_original.cpp

Algorithm (2) "The Blossom Algorithm with Queue" - match_original_queued.cpp

Algorithm (3) "The Naive Algorithm" - match_naive.cpp

The Erdos-Renyi random graphs were generated with gen_graph.cpp.

The algorithms were tested throughout development with test_match.cpp.

Graphs without perfect matching, but an even number of vertices and single component were tested in tutte-tester.cpp.

Asymptotic values (matching size, number of blossoms contracted, number of odd components) was collected with asymp_tester.cpp.

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
.gitignore		.gitignore
BFS_time_0.001.txt		BFS_time_0.001.txt
BFS_time_1.txt		BFS_time_1.txt
README.md		README.md
alg_times.txt		alg_times.txt
caller.cpp		caller.cpp
count_comp.cpp		count_comp.cpp
expected_cycles.cpp		expected_cycles.cpp
gen_graph.cpp		gen_graph.cpp
match_greedy.cpp		match_greedy.cpp
match_naive.cpp		match_naive.cpp
match_original.cpp		match_original.cpp
match_original_queued.cpp		match_original_queued.cpp
num_blossoms.txt		num_blossoms.txt
test_match.cpp		test_match.cpp
tutte-tester.cpp		tutte-tester.cpp

krstnmnlsn/blossom