12345678910111213141516171819202122232425262728293031323334 |
- //=======================================================================
- // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
- //
- // 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 <string>
- #include <iostream>
- #include <boost/graph/adjacency_list.hpp>
- #include <boost/graph/property_iter_range.hpp>
- int
- main()
- {
- using namespace boost;
- typedef adjacency_list < listS, vecS, directedS,
- property < vertex_name_t, std::string > >graph_t;
- graph_t g(3);
- const char *vertex_names[] = { "Kubrick", "Clark", "Hal" };
- int i = 0;
- graph_property_iter_range < graph_t, vertex_name_t >::iterator v, v_end;
- for (boost::tie(v, v_end) = get_property_iter_range(g, vertex_name);
- v != v_end; ++v, ++i)
- *v = vertex_names[i];
- boost::tie(v, v_end) = get_property_iter_range(g, vertex_name);
- std::copy(v, v_end, std::ostream_iterator < std::string > (std::cout, " "));
- std::cout << std::endl;
- return 0;
- }
|