Revert to edge and graph stuff. This time, use a directed graph.

[tinc] / src / node.c

diff --git a/src/node.c b/src/node.c
index e4581cc..a66bc17 100644 (file)
--- a/src/node.c
+++ b/src/node.c
@@ -1,7 +1,7 @@
 /*
     node.c -- node tree management
-    Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.warande.net>,
-                  2001-2002 Ivo Timmermans <itimmermans@bigfoot.com>
+    Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
+                  2001-2002 Ivo Timmermans <ivo@o2w.nl>
 
     This program is free software; you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published by
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: node.c,v 1.1.2.11 2002/03/22 13:31:18 guus Exp $
+    $Id: node.c,v 1.1.2.15 2002/09/04 13:48:52 guus Exp $
 */
 
 #include "config.h"
@@ -123,7 +123,7 @@ cp
       subnet_del(n, s);
     }
 
-  for(node = n->subnet_tree->head; node; node = next)
+  for(node = n->edge_tree->head; node; node = next)
     {
       next = node->next;
       e = (edge_t *)node->data;