ceph/src/boost/libs/graph/example/topo-sort-file-dep.cpp

   1 //=======================================================================
   2 // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
   3 //
   4 // Distributed under the Boost Software License, Version 1.0. (See
   5 // accompanying file LICENSE_1_0.txt or copy at
   6 // http://www.boost.org/LICENSE_1_0.txt)
   7 //=======================================================================
   8 #include <boost/config.hpp>
   9 #include <fstream>
  10 #include <iostream>
  11 #include <string>
  12 #include <boost/graph/adjacency_list.hpp>
  13 #include <boost/graph/graph_utility.hpp>
  14
  15 using namespace boost;
  16
  17 namespace std
  18 {
  19   template < typename T >
  20     std::istream & operator >> (std::istream & in, std::pair < T, T > &p)
  21   {
  22     in >> p.first >> p.second;
  23     return in;
  24   }
  25 }
  26
  27 typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
  28   vecS,                         // Store vertex set in a std::vector
  29   directedS                     // The file dependency graph is directed
  30 > file_dep_graph;
  31
  32 typedef graph_traits < file_dep_graph >::vertex_descriptor vertex_t;
  33 typedef graph_traits < file_dep_graph >::edge_descriptor edge_t;
  34
  35 void
  36 topo_sort_dfs(const file_dep_graph & g, vertex_t u, vertex_t * &topo_order,
  37               int *mark)
  38 {
  39   mark[u] = 1;                  // 1 means visited, 0 means not yet visited
  40   graph_traits < file_dep_graph >::adjacency_iterator vi, vi_end;
  41   for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi)
  42     if (mark[*vi] == 0)
  43       topo_sort_dfs(g, *vi, topo_order, mark);
  44
  45   *--topo_order = u;
  46 }
  47
  48 void
  49 topo_sort(const file_dep_graph & g, vertex_t * topo_order)
  50 {
  51   std::vector < int >mark(num_vertices(g), 0);
  52   graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
  53   for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
  54     if (mark[*vi] == 0)
  55       topo_sort_dfs(g, *vi, topo_order, &mark[0]);
  56 }
  57
  58
  59 int
  60 main()
  61 {
  62   std::ifstream file_in("makefile-dependencies.dat");
  63   typedef graph_traits < file_dep_graph >::vertices_size_type size_type;
  64   size_type n_vertices;
  65   file_in >> n_vertices;        // read in number of vertices
  66   std::istream_iterator < std::pair < size_type, size_type > >
  67     input_begin(file_in), input_end;
  68 #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
  69   // VC++ can't handle the iterator constructor
  70   file_dep_graph g(n_vertices);
  71   while (input_begin != input_end) {
  72     size_type i, j;
  73     boost::tie(i, j) = *input_begin++;
  74     add_edge(i, j, g);
  75   }
  76 #else
  77   file_dep_graph g(input_begin, input_end, n_vertices);
  78 #endif
  79
  80   std::vector < std::string > name(num_vertices(g));
  81   std::ifstream name_in("makefile-target-names.dat");
  82   graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
  83   for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
  84     name_in >> name[*vi];
  85
  86   std::vector < vertex_t > order(num_vertices(g));
  87   topo_sort(g, &order[0] + num_vertices(g));
  88   for (size_type i = 0; i < num_vertices(g); ++i)
  89     std::cout << name[order[i]] << std::endl;
  90
  91   return 0;
  92 }