GeezerVison is showing github.com — boost_graph/example/default-constructor.cpp at develop · stdgraph/boost_graph

Expand file tree

default-constructor.cpp

Copy path

More file actions

Latest commit

History

44 lines (39 loc) · 1.5 KB

default-constructor.cpp

Copy path

File metadata and controls

44 lines (39 loc) · 1.5 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

//=======================================================================

// Distributed under 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)

//=======================================================================

#include <boost/config.hpp>

#include <fstream>

#include <boost/graph/adjacency_list.hpp>

using namespace boost;

template < typename Graph > void read_graph_file(std::istream& in, Graph& g)

{

using size_type = typename graph_traits< Graph >::vertices_size_type;

size_type n_vertices;

in >> n_vertices; // read in number of vertices

for (size_type i = 0; i < n_vertices; ++i) // Add n vertices to the graph

add_vertex(g);

size_type u, v;

while (in >> u) // Read in pairs of integers as edges

if (in >> v)

add_edge(u, v, g);

else

break;

}

int main(int argc, const char** argv)

{

using graph_type = adjacency_list< listS, // Store out-edges of each vertex

// in a std::list

vecS, // Store vertex set in a std::vector

directedS // The graph is directed

graph_type g; // use default constructor to create empty graph

std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");

read_graph_file(file_in, g);

assert(num_vertices(g) == 15);

assert(num_edges(g) == 19);

return 0;

}