mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
67 lines
2.2 KiB
C++
67 lines
2.2 KiB
C++
//=======================================================================
|
|
// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, Indiana University,
|
|
// Bloomington, IN 47405.
|
|
//
|
|
// Permission to modify the code and to distribute the code is
|
|
// granted, provided the text of this NOTICE is retained, a notice if
|
|
// the code was modified is included with the above COPYRIGHT NOTICE
|
|
// and with the COPYRIGHT NOTICE in the LICENSE file, and that the
|
|
// LICENSE file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
#include <boost/config.hpp>
|
|
#include <fstream>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/graph_utility.hpp>
|
|
|
|
using namespace boost;
|
|
|
|
template < typename T >
|
|
std::istream & operator >> (std::istream & in, std::pair < T, T > &p) {
|
|
in >> p.first >> p.second;
|
|
return in;
|
|
}
|
|
|
|
|
|
int
|
|
main()
|
|
{
|
|
typedef 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;
|
|
|
|
std::ifstream file_in("makefile-dependencies.dat");
|
|
typedef graph_traits < graph_type >::vertices_size_type size_type;
|
|
size_type n_vertices;
|
|
file_in >> n_vertices; // read in number of vertices
|
|
|
|
graph_type
|
|
g(n_vertices); // create graph with n vertices
|
|
|
|
// Read in edges
|
|
graph_traits < graph_type >::vertices_size_type u, v;
|
|
while (file_in >> u)
|
|
if (file_in >> v)
|
|
add_edge(u, v, g);
|
|
else
|
|
break;
|
|
|
|
assert(num_vertices(g) == 15);
|
|
assert(num_edges(g) == 19);
|
|
return 0;
|
|
}
|