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.

diff --git a/src/graph.c b/src/graph.c
index 42157b0a994b8cc29630eed36559dac9688e6cb1..1725241157b435f7a6a78c9686004ac5d8f03e7e 100644 (file)
--- a/src/graph.c
+++ b/src/graph.c
@@ -65,7 +65,7 @@
    Please note that sorting on weight is already done by add_edge().
 */
 
-void mst_kruskal(void) {
+static void mst_kruskal(void) {
        splay_node_t *node, *next;
        edge_t *e;
        node_t *n;
@@ -216,7 +216,7 @@ static void sssp_dijkstra(void) {
    Running time: O(E)
 */
 
-void sssp_bfs(void) {
+static void sssp_bfs(void) {
        splay_node_t *node, *to;
        edge_t *e;
        node_t *n;
@@ -369,7 +369,7 @@ static void check_reachability(void) {
 
 void graph(void) {
        subnet_cache_flush();
-       sssp_dijkstra();
+       sssp_bfs();
        check_reachability();
        mst_kruskal();
 }