Go back to breadth first search for path finding.
authorGuus Sliepen <guus@tinc-vpn.org>
Sat, 25 Feb 2012 22:03:09 +0000 (23:03 +0100)
committerGuus Sliepen <guus@tinc-vpn.org>
Sat, 25 Feb 2012 22:03:09 +0000 (23:03 +0100)
commit8b1ad6f76f821648079818f6ff018bbc33b9d9e9
tree4785b03ded9869b914b6bee2f86b666dbcc2aab0
parent36623e15a1c8685e5d8730345c1a7f9c93710fef
Go back to breadth first search for path finding.

If 1.1.x nodes using Dijkstra's algorithm are mixed with 1.0.x nodes using BFS,
then routing loops can occur.
src/graph.c