gen.cpp

// (C) 2014 Arek Olek

#include <iostream>

#include <boost/graph/adjacency_list.hpp>

#include "debug.hpp"
#include "options.hpp"
#include "test_suite.hpp"
#include "range.hpp"

using namespace std;

typedef boost::adjacency_list<
  boost::hash_setS, boost::vecS, boost::undirectedS
  > graph;

int main(int argc, char** argv) {
  options opt(argc, argv);
  int z = opt.get<int>("-z", 1);
  int n = opt.get<int>("-n", 5);
  float p = opt.get<float>("-p", 1);

  test_suite<graph> suite("gnp", z, n, p);

  cout << suite.size() << endl;

  for(auto const& G : suite) {

    show("tego.dot", G, G);

    cout << num_vertices(G) << " " << num_edges(G) << endl;
    for(auto e : range(edges(G)))
      cout << source(e, G) << " " << target(e, G) << endl;

  }

  return 0;
}