#include #include #define MAXNODES 100 /* randomgraph.g Usage: greedy n m greedy n m seed generate a random graph of n nodes and m vertice C.C. McGeoch 2011 Output format: n #number of vertices 2 4 0 # neighbors of v1, ending in 0 1 3 0 # neighbors of v2, ending in 0 2 0 # neighbors of v3, ending in 0 1 0 # neighbors of v4, ending in 0 comments after last adjacency line. */ /*-----------------------------------------------------------*/ main(argc, argv) int argc; char *argv[]; { int nodes[MAXNODES+1][MAXNODES+1]; int n; int m; int src,dst; int i, j; if ((argc != 4) && (argc != 3)) { printf("usage: randomgraph n m (or)\n randomgraph n m seed"); exit(1); } n = atoi (argv[1]); m = atoi (argv[2]); if (n > MAXNODES) { printf("to many vertices, max is %d. Recompile and try again \n",n); exit(1); } if (m > n*(n-1)/2 ){ printf("too many edges for this n. Max is %d \n", n*(n-1)/2 ); exit(1); } if (argc != 4) srand48((long) time(0) ); else srand48((long) atoi (argv[3])); for (i = 1; i < n; i++) for (j=1; j