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

subnet-up/down hooks, use list_t for the todo list.

Browse source
This commit is contained in:
Guus Sliepen 2004-12-01 20:06:39 +00:00
parent c46f56a8b8
commit 40b1692940
1 changed files with 61 additions and 63 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

34
src/graph.c
View file

@ -54,6 +54,7 @@
#include "netutl.h"
#include "node.h"
#include "process.h"
#include "subnet.h"
#include "utils.h"
/* Implementation of Kruskal's algorithm.
@ -141,10 +142,11 @@ void mst_kruskal(void)
void sssp_bfs(void)
{
avl_node_t *node, *from, *next, *to;
avl_node_t *node, *next, *to;
edge_t *e;
node_t *n;
avl_tree_t *todo_tree;
list_t *todo_list;
list_node_t *from, *todonext;
bool indirect;
char *name;
char *address, *port;
@ -153,7 +155,7 @@ void sssp_bfs(void)
cp();
todo_tree = avl_alloc_tree(NULL, NULL);
todo_list = list_alloc(NULL);
/* Clear visited status on nodes */
@ -169,15 +171,11 @@ void sssp_bfs(void)
myself->status.indirect = false;
myself->nexthop = myself;
myself->via = myself;
node = avl_alloc_node();
node->data = myself;
avl_insert_top(todo_tree, node);
list_insert_head(todo_list, myself);
/* Loop while todo_tree is filled */
/* Loop while todo_list is filled */
while(todo_tree->head) {
for(from = todo_tree->head; from; from = next) { /* "from" is the node from which we start */
next = from->next;
for(from = todo_list->head; from; from = todonext) { /* "from" is the node from which we start */
n = from->data;
for(to = n->edge_tree->head; to; to = to->next) { /* "to" is the edge connected to "from" */
@ -202,7 +200,7 @@ void sssp_bfs(void)
not reachable for the nodes left of n. We do as if the indirectdata
flag is set on edge e.
- If edge e provides for better reachability of e->to, update
e->to and (re)add it to the todo_tree to (re)examine the reachability
e->to and (re)add it to the todo_list to (re)examine the reachability
of nodes behind it.
*/
@ -239,16 +237,14 @@ void sssp_bfs(void)
}
}
node = avl_alloc_node();
node->data = e->to;
avl_insert_before(todo_tree, from, node);
list_insert_tail(todo_list, e->to);
}
avl_delete_node(todo_tree, from);
}
todonext = from->next;
list_delete_node(todo_list, from);
}
avl_free_tree(todo_tree);
list_free(todo_list);
/* Check reachability status. */
@ -292,8 +288,10 @@ void sssp_bfs(void)
free(address);
free(port);
for(i = 0; i < 7; i++)
for(i = 0; i < 6; i++)
free(envp[i]);
subnet_update(n, NULL, n->status.reachable);
}
}
}