RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef LEMON_BITS_TRAITS_H

#define LEMON_BITS_TRAITS_H

//\file

//\brief Traits for graphs and maps

//

#include <lemon/bits/enable_if.h>

namespace lemon {

  struct InvalidType {};

  class ItemSetTraits {};

  struct NodeNotifierIndicator {

    typedef InvalidType Type;

  };

  struct NodeNotifierIndicator<

  > {

  };

  public:

    public:

      typedef typename Parent::Value Value;

        : Parent(_digraph, _value) {}

     };

  };

  struct ArcNotifierIndicator {

    typedef InvalidType Type;

  };

  struct ArcNotifierIndicator<

  > {

  };

  public:

    public:

      typedef typename Parent::Value Value;

        : Parent(_digraph, _value) {}

    };

  };

  struct EdgeNotifierIndicator {

    typedef InvalidType Type;

  };

  struct EdgeNotifierIndicator<

  > {

  };

  public:

    public:

      typedef typename Parent::Value Value;

        : Parent(_digraph, _value) {}

    };

  };

  template <typename Map, typename Enable = void>

  struct MapTraits {

    typedef False ReferenceMapTag;

    typedef typename Map::Key Key;

    typedef typename Map::Value Value;

    typedef Value ConstReturnValue;

    typedef Value ReturnValue;

  };

  template <typename Map>

  struct MapTraits<

    Map, typename enable_if<typename Map::ReferenceMapTag, void>::type >

  {

    typedef True ReferenceMapTag;

    typedef typename Map::Key Key;

    typedef typename Map::Value Value;

    typedef typename Map::ConstReference ConstReturnValue;

    typedef typename Map::Reference ReturnValue;

    typedef typename Map::ConstReference ConstReference;

    typedef typename Map::Reference Reference;

 };

  template <typename MatrixMap, typename Enable = void>

  struct MatrixMapTraits {

    typedef False ReferenceMapTag;

    typedef typename MatrixMap::FirstKey FirstKey;

    typedef typename MatrixMap::SecondKey SecondKey;

    typedef typename MatrixMap::Value Value;

    typedef Value ConstReturnValue;

    typedef Value ReturnValue;

  };

  template <typename MatrixMap>

  struct MatrixMapTraits<

    MatrixMap, typename enable_if<typename MatrixMap::ReferenceMapTag,

                                  void>::type >

  {

    typedef True ReferenceMapTag;

    typedef typename MatrixMap::FirstKey FirstKey;

    typedef typename MatrixMap::SecondKey SecondKey;

    typedef typename MatrixMap::Value Value;

    typedef typename MatrixMap::ConstReference ConstReturnValue;

    typedef typename MatrixMap::Reference ReturnValue;

    typedef typename MatrixMap::ConstReference ConstReference;

    typedef typename MatrixMap::Reference Reference;

 };

  // Indicators for the tags

  struct NodeNumTagIndicator {

    static const bool value = false;

  };

  struct NodeNumTagIndicator<

  > {

    static const bool value = true;

  };

  struct ArcNumTagIndicator {

    static const bool value = false;

  };

  struct ArcNumTagIndicator<

  > {

    static const bool value = true;

  };

  struct EdgeNumTagIndicator {

    static const bool value = false;

  };

  struct EdgeNumTagIndicator<

  > {

    static const bool value = true;

  };

  struct FindArcTagIndicator {

    static const bool value = false;

  };

  struct FindArcTagIndicator<

  > {

    static const bool value = true;

  };

  struct FindEdgeTagIndicator {

    static const bool value = false;

  };

  struct FindEdgeTagIndicator<

  > {

    static const bool value = true;

  };

  struct UndirectedTagIndicator {

    static const bool value = false;

  };

  struct UndirectedTagIndicator<

  > {

    static const bool value = true;

  };

  struct BuildTagIndicator {

    static const bool value = false;

  };

  struct BuildTagIndicator<

  > {

    static const bool value = true;

  };

}

#endif

{

  ArgParser ap(argc,argv);

//   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("nonodes", "Draw the edges only in the generated .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"]) {

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

    rnd = Random(seed);

  }

  if (ap.given("seed")) {

    int seed = ap["seed"];

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

    rnd = Random(seed);

  }

  std::string prefix;

  switch(ap.files().size())

    {

    case 0:

      prefix="lgf-gen-out";

      break;

    case 1:

      prefix=ap.files()[0];

      break;

    default:

      std::cerr << "\nAt most one prefix can be given\n\n";

      exit(1);

    }

  double sum_sizes=0;

  std::vector<double> sizes;

  std::vector<double> cum_sizes;

  for(int s=0;s<num_of_cities;s++)

    {

      //         sum_sizes+=rnd.exponential();

      double d=rnd();

      sum_sizes+=d;

      sizes.push_back(d);

      cum_sizes.push_back(sum_sizes);

    }

  int i=0;

  for(int s=0;s<num_of_cities;s++)

    {

      Point center=(num_of_cities==1?Point(0,0):rnd.disc());

      if(gauss_d)

        for(;i<N*(cum_sizes[s]/sum_sizes);i++) {

          Node n=g.addNode();

          nodes.push_back(n);

          coords[n]=center+rnd.gauss2()*area*

            std::sqrt(sizes[s]/sum_sizes);

        }

      else if(square_d)

        for(;i<N*(cum_sizes[s]/sum_sizes);i++) {

          Node n=g.addNode();