j3d1/tinc
1
0
Fork 0
Code Issues 1 Pull requests Releases Wiki Activity

When building the minimum spanning tree, make sure we start from a reachable node.

Browse source
This commit is contained in:
Guus Sliepen 2006-12-12 14:49:09 +00:00
parent 47d916ec5e
commit 8b55dfacb1
1 changed files with 8 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/graph.c
View file

@ -101,7 +101,13 @@ void mst_kruskal(void)
/* Starting point */ /* Starting point */
((edge_t *) edge_weight_tree->head->data)->from->status.visited = true; for(node = edge_weight_tree->head; node; node = next) {
e = node->data;
if(e->from->status.reachable) {
e->from->status.visited = true;
break;
}
}
/* Add safe edges */ /* Add safe edges */
@ -307,8 +313,8 @@ void sssp_bfs(void)
void graph(void) void graph(void)
{ {
mst_kruskal();
sssp_bfs(); sssp_bfs();
mst_kruskal();
graph_changed = true; graph_changed = true;
} }