Fix the minimum spanning tree algorithm.
authorGuus Sliepen <guus@tinc-vpn.org>
Thu, 17 Jan 2013 10:21:18 +0000 (11:21 +0100)
committerGuus Sliepen <guus@tinc-vpn.org>
Thu, 17 Jan 2013 10:21:18 +0000 (11:21 +0100)
Tinc uses Kruskal's algorithm to calculate a MST. However, this was broken in
commit 6e80da3370249caa1082c23c3ef55f338d1e9e74. Revert back to the working
algorithm from tinc 1.0.

Thanks to Cheng LI for spotting the problem.


No differences found