12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091 |
- // Copyright (C) 2007-2008 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)
- #include <boost/graph/use_mpi.hpp>
- #include <boost/config.hpp>
- #include <boost/throw_exception.hpp>
- #include <boost/test/minimal.hpp>
- #include <boost/graph/adjacency_list.hpp>
- #include <boost/graph/iteration_macros.hpp>
- #include <string>
- #include <iostream>
- #ifdef BOOST_NO_EXCEPTIONS
- void
- boost::throw_exception(std::exception const& ex)
- {
- std::cout << ex.what() << std::endl;
- abort();
- }
- #endif
- using namespace boost;
- /// City structure to be attached to each vertex
- struct City {
- City() {}
- City(const std::string& name, int population = -1)
- : name(name), population(population) { }
-
- std::string name;
- int population;
- };
- namespace boost { namespace graph {
- /// Use the City name as a key for indexing cities in a graph
- template<>
- struct internal_vertex_name<City>
- {
- typedef multi_index::member<City, std::string, &City::name> type;
- };
- /// Allow the graph to build cities given only their names (filling in
- /// the defaults for fields).
- template<>
- struct internal_vertex_constructor<City>
- {
- typedef vertex_from_name<City> type;
- };
- } } // end namespace boost::graph
- /// Our road map, where each of the vertices are cities
- typedef adjacency_list<vecS, vecS, directedS, City> RoadMap;
- typedef graph_traits<RoadMap>::vertex_descriptor Vertex;
- int test_main(int argc, char* argv[])
- {
- RoadMap map;
- /// Create vertices for Bloomington, Indianapolis, Chicago
- Vertex bloomington = add_vertex(City("Bloomington", 69291), map);
- Vertex indianapolis = add_vertex(City("Indianapolis", 791926), map);
- Vertex chicago = add_vertex(City("Chicago", 9500000), map);
- BOOST_CHECK(add_vertex(City("Bloomington", 69291), map) == bloomington);
- BGL_FORALL_VERTICES(city, map, RoadMap)
- std::cout << map[city].name << ", population " << map[city].population
- << std::endl;
- BOOST_CHECK(*find_vertex("Bloomington", map) == bloomington);
- BOOST_CHECK(*find_vertex("Indianapolis", map) == indianapolis);
- BOOST_CHECK(*find_vertex("Chicago", map) == chicago);
- add_edge(bloomington, "Indianapolis", map);
- add_edge("Indianapolis", chicago, map);
- add_edge("Indianapolis", "Cincinnati", map);
- BGL_FORALL_EDGES(road, map, RoadMap)
- std::cout << map[source(road, map)].name << " -> "
- << map[target(road, map)].name << std::endl;
- BOOST_CHECK(map[*find_vertex("Cincinnati", map)].population == -1);
- return 0;
- }
|