SmallWorld.cc

Go to the documentation of this file.

#include <iostream>
#include <sstream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/small_world_generator.hpp>
#include <boost/random/linear_congruential.hpp>
#include <boost/graph/graphviz.hpp>


typedef boost::adjacency_list<> Graph;
typedef boost::small_world_iterator<boost::minstd_rand, Graph> SWGen;

void printUsage()
{
  std::cout << "Usage: small_world nb_nodes connectivity rewiring_probability random_generator_seed" << std::endl;
  std::cout << "Produces a small word network (See Boost Graph Library) in 'topo' format on the standard output" << std::endl;
  exit(1);
}

int main(int argc, char ** argv)
{
  if(argc != 5)
        {
          printUsage();
        }
  std::stringstream stream;
  stream << argv[1];
  Graph::vertices_size_type nbNodes = 0;
  stream >> nbNodes;
  stream.clear();

  Graph::vertices_size_type  k = 0;
  stream << argv[2];
  stream >> k;
  stream.clear();

  double probability = 0.0;
  stream << argv[3];
  stream >> probability;
  stream.clear();


  int seed = 0;
  stream << argv[4];
  stream >> seed;
  stream.clear();
  
  boost::minstd_rand gen;
  gen.seed(seed);

  Graph g(SWGen(gen, nbNodes, k, probability), SWGen(), nbNodes);
  typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap;
  IndexMap index = get(boost::vertex_index, g);
  std::pair<Graph::edge_iterator,Graph::edge_iterator> pair = edges(g);
  std::cout << "p top " << num_vertices(g) << " " << num_edges(g) << std::endl;
  unsigned i = 0;
  for(Graph::edge_iterator it = pair.first; it != pair.second; ++it)
        {
          std::cout << "c" << i << ": n" << index[source(*it,g)] << ", n" << index[target(*it,g)] << ";" << std::endl;
          ++i;
        }
  return 0;
}