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)
commit1ddd6111a40733929089316838020f89176cbda2
treef5e05df10d4cecb20d3d3cd7ced7faa3fe2d4d5c
parent61275547cdf950e1c4499f19044ff171a9a74af7
Fix the minimum spanning tree algorithm.

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.
src/graph.c