Simulation Simplified
6. Graphs
Class P2Pedia01

import edu.rit.util.Random;
public class P2Pedia01
   {
   public static void main
      (String[] args)
      throws Exception
      {
      if (args.length != 4) usage();
      int N = Integer.parseInt (args[0]);
      int K = Integer.parseInt (args[1]);
      int T = Integer.parseInt (args[2]);
      long seed = Long.parseLong (args[3]);
      Random prng = Random.getInstance (seed);
      int[][] conn = new int[N][K+1];
      for (int i = 0; i < N; ++ i) conn[i][0] = (i + 1)%N;
      int sumPathLength = 0;
      for (int trial = 0; trial < T; ++ trial)
         {
         for (int i = 0; i < N; ++ i)
            {
            for (int j = 1; j <= K; ++ j)
               {
               // conn[i][j] = random node
               }
            }
         int orig = prng.nextInt (N);
         int match = prng.nextInt (N);
         sumPathLength +=
            shortestPathLength (conn, orig, match);
         }
      System.out.printf ("Average query path length = %.2f%n",
         ((double) sumPathLength)/((double) T));
      }

   private static int shortestPathLength
      (int[][] conn,
       int orig,
       int match)
      {
      return 0; // STUB
      }

   private static void usage()
      {
      System.err.println
         ("Usage: java P2Pedia01 <N> <K> <T> <seed>");
      System.exit (1);
      }
   }