#include <boost/graph/use_mpi.hpp>

#include <boost/graph/distributed/betweenness_centrality.hpp>

#include <boost/graph/distributed/adjacency_list.hpp>

#include <boost/config.hpp>
#include <boost/throw_exception.hpp>
#include <boost/graph/distributed/mpi_process_group.hpp>
#include <boost/graph/distributed/concepts.hpp>
#include <boost/graph/erdos_renyi_generator.hpp>

#include <boost/random/linear_congruential.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/property_map/vector_property_map.hpp>

// METIS Input
#include <boost/graph/metis.hpp>
#include <boost/graph/distributed/graphviz.hpp>

//#include <cstring>

#ifdef BOOST_NO_EXCEPTIONS
void
boost::throw_exception(std::exception const& ex)
{
    std::cout << ex.what() << std::endl;
    abort();
}
#endif

using namespace boost;
using boost::graph::distributed::mpi_process_group;

int main(int argc, char* argv[])
{
  mpi::environment env(argc, argv);

  typedef adjacency_list<vecS, 
                         distributedS<mpi_process_group, vecS>,
                         undirectedS,
                         property<vertex_centrality_t,float>,
                         property<edge_weight_t, int> > Graph;

  const char* filename = argv[1];

  // Open the METIS input file
  std::ifstream in(filename);
  graph::metis_reader reader(in);

 /* 
  const char* partitions_file = argv[2];
  mpi_process_group pg;
  std::ifstream in_partitions(partitions_file);
  boost::graph::metis_distribution dist(in_partitions, pg); 
  */


  // Load the graph using the default distribution
  Graph g(reader.begin(), reader.end(), reader.weight_begin(),
          reader.num_vertices()/*, pg, dist*/);
	
  // Test Betweenness Centrality
  brandes_betweenness_centrality(g, centrality_map(get(vertex_centrality,g)));
  
  return 0;
}