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

Fix MST algorithm.

Browse source
This commit is contained in:
Guus Sliepen 2002-09-06 21:02:36 +00:00
parent 66741978e1
commit a8ddba42b9
1 changed files with 3 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/graph.c
View file

@ -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.16 2002/09/06 09:48:39 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++;