My Project
Visitor.h
1 #include <boost/graph/depth_first_search.hpp>
2 #include <boost/graph/properties.hpp>
3 #include <boost/graph/graph_traits.hpp>
4 #include <boost/graph/adjacency_list.hpp>
5 #pragma once
6 class Visitor : public boost::default_dfs_visitor
7 {
8 public:
9  Visitor();
10  ~Visitor();
11 
12  typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS> Graph;
13  typedef boost::graph_traits<Graph>::vertex_descriptor Vertex;
14  typedef boost::graph_traits<Graph>::edge_descriptor Edge;
15 
16  /*
17  void discover_vertex(Vertex v, Graph& g)
18  {
19  std::cout << v << std::endl;
20  visited.push_back(v);
21  return;
22  }
23 
24  void back_edge(Edge e, Graph& g) {
25  //_has_cycle = true;
26 
27  }
28  */
29 
30  std::vector<Vertex> visited;
31 
32  //void discover_vertex(int v, Graph g);
33  //std::vector<int> visited;
34 };
35 
Definition: Visitor.h:6