diff options
| author | minskim <minskim@pkgsrc.org> | 2006-05-05 23:14:43 +0000 |
|---|---|---|
| committer | minskim <minskim@pkgsrc.org> | 2006-05-05 23:14:43 +0000 |
| commit | b526a0c0082202a1475b93fcadec04bf289f1aca (patch) | |
| tree | 639d35cd3aba34ce0dcb73b91e4b4bbbb94cca05 /net/gt-itm/patches | |
| parent | 6f0ce4ca1402fad4dc2228bdce486c817a16954d (diff) | |
| download | pkgsrc-b526a0c0082202a1475b93fcadec04bf289f1aca.tar.gz | |
Import gt-itm.
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.
Diffstat (limited to 'net/gt-itm/patches')
| -rw-r--r-- | net/gt-itm/patches/patch-aa | 13 | ||||
| -rw-r--r-- | net/gt-itm/patches/patch-ab | 23 |
2 files changed, 36 insertions, 0 deletions
diff --git a/net/gt-itm/patches/patch-aa b/net/gt-itm/patches/patch-aa new file mode 100644 index 00000000000..b1a3b8d59bd --- /dev/null +++ b/net/gt-itm/patches/patch-aa @@ -0,0 +1,13 @@ +$NetBSD: patch-aa,v 1.1.1.1 2006/05/05 23:14:43 minskim Exp $ + +--- Makefile.orig 1996-10-23 14:05:26.000000000 -0700 ++++ Makefile +@@ -12,7 +12,7 @@ + #LIBS = -lm -lgb5 + + # For SunOS: uncomment the next line +-LIBS = -lm -lgb4 ++LIBS = -lm -lgb + + + IDIR = ../include diff --git a/net/gt-itm/patches/patch-ab b/net/gt-itm/patches/patch-ab new file mode 100644 index 00000000000..e4eecfbc8ea --- /dev/null +++ b/net/gt-itm/patches/patch-ab @@ -0,0 +1,23 @@ +$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)); + } |