Fix MST algorithm.

[tinc] / src / graph.c

diff --git a/src/graph.c b/src/graph.c
index b5e81931f8d9aed4dc7526f2f1a02026696a6f93..b9fbbde64c0d89bb870aec5acf2c51b4ab604e41 100644 (file)
--- a/src/graph.c
+++ b/src/graph.c
@@ -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: graph.c,v 1.1.2.15 2002/09/04 13:48:51 guus Exp $
+    $Id: graph.c,v 1.1.2.17 2002/09/06 21:02:36 guus Exp $
 */
 
 /* We need to generate two trees from the graph:
@@ -128,6 +128,8 @@ void mst_kruskal(void)
       e->to->status.visited = 1;
       if(e->connection)
         e->connection->status.mst = 1;
+      if(e->reverse->connection)
+        e->reverse->connection->status.mst = 1;
 
       safe_edges++;
 
@@ -266,7 +268,6 @@ void sssp_bfs(void)
 
        n->status.validkey = 0;
        n->status.waitingforkey = 0;
-       n->sent_seqno = 0;
 
        asprintf(&envp[0], "NETNAME=%s", netname?netname:"");
        asprintf(&envp[1], "DEVICE=%s", device?device:"");