RhodeCode

//   bool eps;

  bool disc_d, square_d, gauss_d;

//   bool tsp_a,two_a,tree_a;

  int num_of_cities=1;

  double area=1;

  N=100;

//   girth=10;

  std::string ndist("disc");

  ap.refOption("n", "Number of nodes (default is 100)", N)

    .intOption("g", "Girth parameter (default is 10)", 10)

    .refOption("cities", "Number of cities (default is 1)", num_of_cities)

    .refOption("area", "Full relative area of the cities (default is 1)", area)

    .refOption("disc", "Nodes are evenly distributed on a unit disc (default)",disc_d)

    .optionGroup("dist", "disc")

    .refOption("square", "Nodes are evenly distributed on a unit square", square_d)

    .optionGroup("dist", "square")

    .refOption("gauss",

            "Nodes are located according to a two-dim gauss distribution",

            gauss_d)

    .optionGroup("dist", "gauss")

//     .mandatoryGroup("dist")

    .onlyOneGroup("dist")

    .boolOption("eps", "Also generate .eps output (prefix.eps)")

    .boolOption("dir", "Directed digraph is generated (each arcs are replaced by two directed ones)")

    .boolOption("2con", "Create a two connected planar digraph")

    .optionGroup("alg","2con")

    .boolOption("tree", "Create a min. cost spanning tree")

    .optionGroup("alg","tree")

    .boolOption("tsp", "Create a TSP tour")

    .optionGroup("alg","tsp")

    .boolOption("tsp2", "Create a TSP tour (tree based)")

    .optionGroup("alg","tsp2")

    .boolOption("dela", "Delaunay triangulation digraph")

    .optionGroup("alg","dela")

    .onlyOneGroup("alg")

    .boolOption("rand", "Use time seed for random number generator")

    .optionGroup("rand", "rand")

    .intOption("seed", "Random seed", -1)

    .optionGroup("rand", "seed")

    .onlyOneGroup("rand")

    .other("[prefix]","Prefix of the output files. Default is 'lgf-gen-out'")

    .run();

  if (ap["rand"]) {

    int seed = time(0);

    std::cout << "Random number seed: " << seed << std::endl;

    rnd = Random(seed);

    std::cout << "Make triangles\n";

    //   triangle();

    sparseTriangle(ap["g"]);

    std::cout << "Make it sparser\n";

    sparse2(ap["g"]);

  }

  else if(ap["tree"]) {

    minTree();

  }

  else if(ap["dela"]) {

    delaunay();

  }

  std::cout << "Number of nodes    : " << countNodes(g) << std::endl;

  std::cout << "Number of arcs    : " << countEdges(g) << std::endl;

  double tlen=0;

  for(EdgeIt e(g);e!=INVALID;++e)

    tlen+=sqrt((coords[g.v(e)]-coords[g.u(e)]).normSquare());

  std::cout << "Total arc length  : " << tlen << std::endl;

  if(ap["eps"])

    graphToEps(g,prefix+".eps").scaleToA4().

      scale(600).nodeScale(.005).arcWidthScale(.001).preScale(false).

  if(ap["dir"])

    DigraphWriter<ListGraph>(g,prefix+".lgf").

      nodeMap("coordinates_x",scaleMap(xMap(coords),600)).

      nodeMap("coordinates_y",scaleMap(yMap(coords),600)).

      run();

  else GraphWriter<ListGraph>(g,prefix+".lgf").

         nodeMap("coordinates_x",scaleMap(xMap(coords),600)).

         nodeMap("coordinates_y",scaleMap(yMap(coords),600)).

         run();

}