Implement and compare minimum spanning tree algorithms

[krzysztof-turowski]

Implement minimum spanning tree algorithms, for example:

• Chi-Chin Yao (1975) - An $O(|E| \log \log |V|)$ Algorithm for Finding Minimum Spanning Trees - $O(m \log{\log{n}})$ time
• Fredman, Tarjan (1987) - Fibonacci heaps and their uses in improved network optimization algorithms - $O(m \beta(m, n))$ time
• Gabow, Galil, Spencer, Tarjan (1986) - Efficient algorithms for finding minimum spanning trees in undirected and directed graphs - $O(m \log{\beta(m, n)})$ time
• Karger, Klein, Tarjan (1995) - A randomized linear-time algorithm to find minimum spanning trees - expected $O(m + n)$ time
• Chazelle (1997) - A faster deterministic algorithm for minimum spanning trees - $O(m \alpha(m, n) \log{\alpha(m, n)})$ time
• Chazelle (2000) - A minimum spanning tree algorithm with inverse-Ackermann type complexity - $O(m \alpha(m, n))$ time
• Pettie, Ramachadran (2002) - An optimal minimum spanning tree algorithm

Also approximate algorithms, such as:

• Chazelle, Rubinfeld, Trevisan (2005) - Approximating the Minimum Spanning Tree Weight in Sublinear Time