2 graph.c -- graph algorithms
3 Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
4 2001-2002 Ivo Timmermans <ivo@o2w.nl>
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 $Id: graph.c,v 1.1.2.22 2003/01/17 00:37:17 guus Exp $
23 /* We need to generate two trees from the graph:
25 1. A minimum spanning tree for broadcasts,
26 2. A single-source shortest path tree for unicasts.
28 Actually, the first one alone would suffice but would make unicast packets
29 take longer routes than necessary.
31 For the MST algorithm we can choose from Prim's or Kruskal's. I personally
32 favour Kruskal's, because we make an extra AVL tree of edges sorted on
33 weights (metric). That tree only has to be updated when an edge is added or
34 removed, and during the MST algorithm we just have go linearly through that
35 tree, adding safe edges until #edges = #nodes - 1. The implementation here
36 however is not so fast, because I tried to avoid having to make a forest and
39 For the SSSP algorithm Dijkstra's seems to be a nice choice. Currently a
40 simple breadth-first search is presented here.
42 The SSSP algorithm will also be used to determine whether nodes are directly,
43 indirectly or not reachable from the source. It will also set the correct
44 destination address and port of a node if possible.
52 #ifdef HAVE_SYS_PARAM_H
53 #include <sys/param.h>
55 #include <netinet/in.h>
63 #include "connection.h"
69 /* Implementation of Kruskal's algorithm.
71 Please note that sorting on weight is already done by add_edge().
74 void mst_kruskal(void)
76 avl_node_t *node, *next;
86 /* Clear MST status on connections */
88 for(node = connection_tree->head; node; node = node->next) {
89 c = (connection_t *) node->data;
93 /* Do we have something to do at all? */
95 if(!edge_weight_tree->head)
98 if(debug_lvl >= DEBUG_SCARY_THINGS)
99 syslog(LOG_DEBUG, "Running Kruskal's algorithm:");
101 /* Clear visited status on nodes */
103 for(node = node_tree->head; node; node = node->next) {
104 n = (node_t *) node->data;
105 n->status.visited = 0;
111 ((edge_t *) edge_weight_tree->head->data)->from->status.visited = 1;
115 for(skipped = 0, node = edge_weight_tree->head; node; node = next) {
117 e = (edge_t *) node->data;
119 if(!e->reverse || e->from->status.visited == e->to->status.visited) {
124 e->from->status.visited = 1;
125 e->to->status.visited = 1;
128 e->connection->status.mst = 1;
130 if(e->reverse->connection)
131 e->reverse->connection->status.mst = 1;
135 if(debug_lvl >= DEBUG_SCARY_THINGS)
136 syslog(LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
137 e->to->name, e->weight);
141 next = edge_weight_tree->head;
146 if(debug_lvl >= DEBUG_SCARY_THINGS)
147 syslog(LOG_DEBUG, "Done, counted %d nodes and %d safe edges.", nodes,
151 /* Implementation of a simple breadth-first search algorithm.
157 avl_node_t *node, *from, *next, *to;
160 avl_tree_t *todo_tree;
163 char *address, *port;
169 todo_tree = avl_alloc_tree(NULL, NULL);
171 /* Clear visited status on nodes */
173 for(node = node_tree->head; node; node = node->next) {
174 n = (node_t *) node->data;
175 n->status.visited = 0;
176 n->status.indirect = 1;
179 /* Begin with myself */
181 myself->status.visited = 1;
182 myself->status.indirect = 0;
183 myself->nexthop = myself;
184 myself->via = myself;
185 node = avl_alloc_node();
187 avl_insert_top(todo_tree, node);
189 /* Loop while todo_tree is filled */
191 while(todo_tree->head) {
192 for(from = todo_tree->head; from; from = next) { /* "from" is the node from which we start */
194 n = (node_t *) from->data;
196 for(to = n->edge_tree->head; to; to = to->next) { /* "to" is the edge connected to "from" */
197 e = (edge_t *) to->data;
206 ------(n)-----(e->to)
210 n->address is set to the e->address of the edge left of n to n.
211 We are currently examining the edge e right of n from n:
213 - If e->reverse->address != n->address, then e->to is probably
214 not reachable for the nodes left of n. We do as if the indirectdata
215 flag is set on edge e.
216 - If edge e provides for better reachability of e->to, update
217 e->to and (re)add it to the todo_tree to (re)examine the reachability
221 indirect = n->status.indirect || e->options & OPTION_INDIRECT
222 || ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
224 if(e->to->status.visited
225 && (!e->to->status.indirect || indirect))
228 e->to->status.visited = 1;
229 e->to->status.indirect = indirect;
230 e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
231 e->to->via = indirect ? n->via : e->to;
232 e->to->options = e->options;
234 if(sockaddrcmp(&e->to->address, &e->address)) {
235 node = avl_unlink(node_udp_tree, e->to);
236 e->to->address = e->address;
239 free(e->to->hostname);
241 e->to->hostname = sockaddr2hostname(&e->to->address);
242 avl_insert_node(node_udp_tree, node);
245 node = avl_alloc_node();
247 avl_insert_before(todo_tree, from, node);
250 avl_delete_node(todo_tree, from);
254 avl_free_tree(todo_tree);
256 /* Check reachability status. */
258 for(node = node_tree->head; node; node = next) {
260 n = (node_t *) node->data;
262 if(n->status.visited != n->status.reachable) {
263 n->status.reachable = !n->status.reachable;
265 if(debug_lvl >= DEBUG_TRAFFIC) {
266 if(n->status.reachable)
267 syslog(LOG_DEBUG, _("Node %s (%s) became reachable"),
268 n->name, n->hostname);
270 syslog(LOG_DEBUG, _("Node %s (%s) became unreachable"),
271 n->name, n->hostname);
274 n->status.validkey = 0;
275 n->status.waitingforkey = 0;
277 asprintf(&envp[0], "NETNAME=%s", netname ? : "");
278 asprintf(&envp[1], "DEVICE=%s", device ? : "");
279 asprintf(&envp[2], "INTERFACE=%s", interface ? : "");
280 asprintf(&envp[3], "NODE=%s", n->name);
281 sockaddr2str(&n->address, &address, &port);
282 asprintf(&envp[4], "REMOTEADDRESS=%s", address);
283 asprintf(&envp[5], "REMOTEPORT=%s", port);
287 n->status.reachable ? "hosts/%s-up" : "hosts/%s-down",
289 execute_script(name, envp);
295 for(i = 0; i < 7; i++)