// Copyright (C) 2006 The Trustees of Indiana University. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // Authors: Brian Barrett // Nick Edmonds // Andrew Lumsdaine #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef BOOST_NO_EXCEPTIONS void boost::throw_exception(std::exception const& ex) { std::cout << ex.what() << std::endl; abort(); } #endif using namespace boost; using namespace boost::graph; using boost::graph::distributed::mpi_process_group; typedef double time_type; inline time_type get_time() { return MPI_Wtime(); } std::string print_time(time_type t) { std::ostringstream out; out << std::setiosflags(std::ios::fixed) << std::setprecision(2) << t; return out.str(); } void test_dimacs_reader(const char *filename) { mpi_process_group pg; typedef adjacency_list, undirectedS> Graph; std::ifstream file(filename); dimacs_basic_reader reader = dimacs_basic_reader(file, false); dimacs_basic_reader end; boost::parallel::variant_distribution distrib = boost::parallel::block(pg, reader.n_vertices()); Graph g(dimacs_edge_iterator(reader), dimacs_edge_iterator(end), reader.n_vertices(), pg, distrib);; // write_graphviz("reader.dot", g); } int test_main(int argc, char* argv[]) { mpi::environment env(argc, argv); if (argc == 2) { test_dimacs_reader(argv[1]); } return 0; }