geometric.hh

Go to the documentation of this file.

#ifndef __MINLCA_UTILS_GENERATORS_GEOMETRIC_HH
#define __MINLCA_UTILS_GENERATORS_GEOMETRIC_HH

#include <lemon/smart_graph.h>
#include <lemon/random.h>
#include "random-graph.hh"


namespace minlca
{
namespace utils
{

template<typename BaseGraph = lemon::SmartGraph>
class RandomGeometric : public RandomGraph<BaseGraph>
{
protected:
  typedef RandomGeometric<BaseGraph> Graph;
  typedef RandomGraph<BaseGraph> Base;

public:
  TEMPLATE_GRAPH_TYPEDEFS(Graph);

protected:
  typedef typename Graph::template NodeMap<lemon::dim2::Point<double>> Coords;
  using Base::_r;
  Coords _coords; 
  int _n; 
  double _rad_sq; 

public:
  template<typename Number = int>
  RandomGeometric(Number seed = 0)
    : Base(seed), _coords(*this)
  {
  }

  RandomGeometric(lemon::Random &r)
    : Base(r), _coords(*this)
  {
  }

  Graph &init(
    int n, 
    double radSq 
  )
  {
    _n = n;
    _rad_sq = radSq;

    return *this;
  }

  virtual void generate()
  {
    this->clear();
    this->reserveNode(_n);

    for (int i = 0; i < _n; ++i) {
      Node v = this->addNode();
      _coords[v] = _r->disc();
    }

    for (int i = 0; i < _n; ++i) {
      Node u = this->nodeFromId(i);

      for (int j = i + 1; j < _n; ++j) {
        Node v = this->nodeFromId(j);

        if ((_coords[v] - _coords[u]).normSquare() < _rad_sq) {
          this->addEdge(u, v);
        }
      }
    }
  }

  lemon::dim2::Point<double> coord(
    const Node &v
  ) const
  {
    return _coords[v];
  }

  const Coords &coords() const
  {
    return _coords;
  }
};
}
}

#endif