A C++ implementation for an Expected Linear-Time Minimum Spanning Tree Algorithm(Karger-Klein-Tarjan + Hagerup Minimum Spanning Tree Verification as a sub-routine)

This was the product of my CS undergraduate thesis. I was studying randomized algorithms and I couldn't find any reasonable implementation of Karger-Klein-Tarjan algorithm (at least a public one), so I decided to implement it myself and make it public.

The objectives of this projects are the following:

1. Provide a C++ implementation of Karger, Klein & Tarjan algorithm for finding MSTs in expected linear time available.
2. Benchmark the implementation against standard MST methods (Kruskal, Prim, Boruvka)

Assumptions regarding input graphs:

1. All implementations of this project assume that the edge weights are unique, this is mentioned on the KKT paper as a requirement and it simplifies the design/analysis of the algorithm.
2. We are at all times dealing with undirected graphs!!

How to build the project

1. Install Bazel

2. Run the following command on your command line:

   $ bazel build :all

How to run tests

1. Build the project in the way described above

2. Run the following command at your command line:

   $ bazel test :all --cache_test_results=no

How to run benchmarks

1. Build the project as described above

2. Run the following command at your command line:

   $ bazel run benchmark:mst_benchmark -c opt

Benchmark Comments

All MST algorithms have been tested with random undirected connected graphs with unique discrete edge weights. The runtime complexity has been estimated automatically by using google/benchmark

Results

1. The KKT implementation provided has a linear behavior in practice (in the datasets tested). See results in the benchmark.txt file for the repo.
2. All the other tested algorithms don't have linear complexity in theory and this is also true for the benchmark graph instances.
3. The KKT algorithm still performed poorly compared to the other algorithms, because of a huge constant factor.