6ec6def9b6
GT-ITM contains code to generate graphs that model the topological structure of internetworks. In addition, some sample graphs are provided. More detail on most of the methods can be found in the paper: "How to Model an Internetwork," Ellen Zegura, Ken Calvert, and Samrat Bhattacharjee, Proceedings of IEEE Infocom '96.
23 lines
655 B
Text
23 lines
655 B
Text
$NetBSD: patch-ab,v 1.1.1.1 2006/05/05 23:14:43 minskim Exp $
|
|
|
|
--- eval.c.orig 1996-10-23 14:05:27.000000000 -0700
|
|
+++ eval.c
|
|
@@ -5,7 +5,7 @@
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
-#include <malloc.h>
|
|
+#include <stdlib.h>
|
|
#include "gb_graph.h"
|
|
#include "gb_dijk.h"
|
|
#include "eval.h"
|
|
@@ -159,8 +159,7 @@ int bicomp(Graph *g,int verbose)
|
|
if (u == &dummy) {
|
|
if (verbose) {
|
|
if (artic_pt)
|
|
- printf(" and %d (this ends a connected
|
|
- component of the graph)\n", idx(g, artic_pt));
|
|
+ printf(" and %d (this ends a connected component of the graph)\n", idx(g, artic_pt));
|
|
else
|
|
printf("Isolated vertex %d\n", idx(g, v));
|
|
}
|