along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- $Id: graph.c,v 1.1.2.20 2002/09/10 09:40:21 guus Exp $
+ $Id: graph.c,v 1.1.2.22 2003/01/17 00:37:17 guus Exp $
*/
/* We need to generate two trees from the graph:
#include <stdio.h>
#include <syslog.h>
-#include "config.h"
#include <string.h>
#ifdef HAVE_SYS_PARAM_H
#include <sys/param.h>
/* Situation:
- /
+ /
/
------(n)-----(e->to)
\
- \
+ \
n->address is set to the e->address of the edge left of n to n.
We are currently examining the edge e right of n from n:
- If e->reverse->address != n->address, then e->to is probably
- not reachable for the nodes left of n. We do as if the indirectdata
- flag is set on edge e.
+ 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
- of nodes behind it.
+ e->to and (re)add it to the todo_tree to (re)examine the reachability
+ of nodes behind it.
*/
indirect = n->status.indirect || e->options & OPTION_INDIRECT
- || ((n != myself)
- && sockaddrcmp(&n->address, &e->reverse->address));
+ || ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
if(e->to->status.visited
&& (!e->to->status.indirect || indirect))