mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
90 lines
3.4 KiB
C++
90 lines
3.4 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 <string>
|
|
#include <unistd.h>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
|
|
using namespace boost;
|
|
|
|
template < typename Graph, typename VertexNamePropertyMap > void
|
|
read_graph_file(std::istream & graph_in, std::istream & name_in,
|
|
Graph & g, VertexNamePropertyMap name_map)
|
|
{
|
|
typedef typename graph_traits < Graph >::vertices_size_type size_type;
|
|
size_type n_vertices;
|
|
typename graph_traits < Graph >::vertex_descriptor u;
|
|
typename property_traits < VertexNamePropertyMap >::value_type name;
|
|
|
|
graph_in >> n_vertices; // read in number of vertices
|
|
for (size_type i = 0; i < n_vertices; ++i) { // Add n vertices to the graph
|
|
u = add_vertex(g);
|
|
name_in >> name;
|
|
put(name_map, u, name); // ** Attach name property to vertex u **
|
|
}
|
|
size_type src, targ;
|
|
while (graph_in >> src) // Read in edges
|
|
if (graph_in >> targ)
|
|
add_edge(src, targ, g); // add an edge to the graph
|
|
else
|
|
break;
|
|
}
|
|
|
|
|
|
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
|
|
property < vertex_name_t, std::string > // Add a vertex property
|
|
>graph_type;
|
|
|
|
graph_type g; // use default constructor to create empty graph
|
|
std::ifstream file_in("makefile-dependencies.dat"),
|
|
name_in("makefile-target-names.dat");
|
|
if (!file_in) {
|
|
std::cerr << "** Error: could not open file makefile-target-names.dat"
|
|
<< std::endl;
|
|
exit(-1);
|
|
}
|
|
// Obtain internal property map from the graph
|
|
property_map < graph_type, vertex_name_t >::type name_map =
|
|
get(vertex_name, g);
|
|
read_graph_file(file_in, name_in, g, name_map);
|
|
|
|
// Create storage for last modified times
|
|
std::vector < time_t > last_mod_vec(num_vertices(g));
|
|
// Create nickname for the property map type
|
|
typedef iterator_property_map < std::vector < time_t >::iterator,
|
|
property_map < graph_type, vertex_index_t >::type > iter_map_t;
|
|
// Create last modified time property map
|
|
iter_map_t mod_time_map(last_mod_vec.begin(), get(vertex_index, g));
|
|
|
|
assert(num_vertices(g) == 15);
|
|
assert(num_edges(g) == 19);
|
|
return 0;
|
|
}
|