sl@0: //=======================================================================
sl@0: // Copyright 2001 University of Notre Dame.
sl@0: // Author: Jeremy G. Siek
sl@0: //
sl@0: // Distributed under the Boost Software License, Version 1.0. (See
sl@0: // accompanying file LICENSE_1_0.txt or copy at
sl@0: // http://www.boost.org/LICENSE_1_0.txt)
sl@0: //=======================================================================
sl@0: 
sl@0: /*
sl@0:  * © Portions copyright (c) 2006-2007 Nokia Corporation.  All rights reserved.
sl@0: */
sl@0: 
sl@0: /*
sl@0:   Sample output:
sl@0: 
sl@0:   G0:
sl@0:   0 --> 1 
sl@0:   1 --> 2 3 
sl@0:   2 --> 5 
sl@0:   3 --> 
sl@0:   4 --> 1 5 
sl@0:   5 --> 3 
sl@0:   0(0,1) 1(1,2) 2(1,3) 6(2,5) 3(4,1) 4(4,5) 5(5,3) 
sl@0: 
sl@0:   G1:
sl@0:   2 --> 5 
sl@0:   4 --> 5 
sl@0:   5 --> 
sl@0:   6(2,5) 4(4,5) 
sl@0: 
sl@0:   G2:
sl@0:   0 --> 1 
sl@0:   1 --> 
sl@0:   0(0,1) 
sl@0: 
sl@0:  */
sl@0: 
sl@0: #include <boost/config.hpp>
sl@0: #include <iostream>
sl@0: #include <boost/graph/subgraph.hpp>
sl@0: #include <boost/graph/adjacency_list.hpp>
sl@0: #include <boost/graph/graph_utility.hpp>
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: #include "std_log_result.h"
sl@0: #define LOG_FILENAME_LINE __FILE__, __LINE__
sl@0: #endif
sl@0: 
sl@0: 
sl@0: 
sl@0: int main(int,char*[])
sl@0: {
sl@0:   using namespace boost;
sl@0:   typedef adjacency_list_traits<vecS, vecS, directedS> Traits;
sl@0:   typedef subgraph< adjacency_list<vecS, vecS, directedS,
sl@0:     property<vertex_color_t, int>, property<edge_index_t, int> > > Graph;
sl@0: 
sl@0:   const int N = 6;
sl@0:   Graph G0(N);
sl@0:   enum { A, B, C, D, E, F};     // for conveniently refering to vertices in G0
sl@0: 
sl@0:   Graph& G1 = G0.create_subgraph();
sl@0:   Graph& G2 = G0.create_subgraph();
sl@0:   enum { A1, B1, C1 };          // for conveniently refering to vertices in G1
sl@0:   enum { A2, B2 };              // for conveniently refering to vertices in G2
sl@0: 
sl@0:   add_vertex(C, G1); // global vertex C becomes local A1 for G1
sl@0:   add_vertex(E, G1); // global vertex E becomes local B1 for G1
sl@0:   add_vertex(F, G1); // global vertex F becomes local C1 for G1
sl@0:   
sl@0:   add_vertex(A, G2); // global vertex A becomes local A1 for G2
sl@0:   add_vertex(B, G2); // global vertex B becomes local B1 for G2
sl@0: 
sl@0:   add_edge(A, B, G0);
sl@0:   add_edge(B, C, G0);
sl@0:   add_edge(B, D, G0);
sl@0:   add_edge(E, B, G0);
sl@0:   add_edge(E, F, G0);
sl@0:   add_edge(F, D, G0);
sl@0: 
sl@0:   add_edge(A1, C1, G1); // (A1,C1) is subgraph G1 local indices for (C,F).
sl@0: 
sl@0:   std::cout << "G0:" << std::endl;
sl@0:   print_graph(G0, get(vertex_index, G0));
sl@0:   print_edges2(G0, get(vertex_index, G0), get(edge_index, G0));
sl@0:   std::cout << std::endl;
sl@0: 
sl@0:   Graph::children_iterator ci, ci_end;
sl@0:   int num = 1;
sl@0:   for (tie(ci, ci_end) = G0.children(); ci != ci_end; ++ci) {
sl@0:     std::cout << "G" << num++ << ":" << std::endl;
sl@0:     print_graph(*ci, get(vertex_index, *ci));
sl@0:     print_edges2(*ci, get(vertex_index, *ci), get(edge_index, *ci));
sl@0:     std::cout << std::endl;
sl@0:   }
sl@0:   
sl@0:   #ifdef __SYMBIAN32__
sl@0: 	std_log(LOG_FILENAME_LINE,"[End Test Case ]");
sl@0: 	testResultXml("subgraph");
sl@0: 	close_log_file();
sl@0:   #endif
sl@0: 
sl@0:   return 0;
sl@0: }