//======================================================================= // 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 <iostream> #include <vector> #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/tuple/tuple.hpp> enum family { Jeanie, Debbie, Rick, John, Amanda, Margaret, Benjamin, N }; int main() { using namespace boost; const char *name[] = { "Jeanie", "Debbie", "Rick", "John", "Amanda", "Margaret", "Benjamin" }; adjacency_list <> g(N); add_edge(Jeanie, Debbie, g); add_edge(Jeanie, Rick, g); add_edge(Jeanie, John, g); add_edge(Debbie, Amanda, g); add_edge(Rick, Margaret, g); add_edge(John, Benjamin, g); graph_traits < adjacency_list <> >::vertex_iterator i, end; graph_traits < adjacency_list <> >::adjacency_iterator ai, a_end; property_map < adjacency_list <>, vertex_index_t >::type index_map = get(vertex_index, g); for (tie(i, end) = vertices(g); i != end; ++i) { std::cout << name[get(index_map, *i)]; tie(ai, a_end) = adjacent_vertices(*i, g); if (ai == a_end) std::cout << " has no children"; else std::cout << " is the parent of "; for (; ai != a_end; ++ai) { std::cout << name[get(index_map, *ai)]; if (boost::next(ai) != a_end) std::cout << ", "; } std::cout << std::endl; } return EXIT_SUCCESS; }