#include <cstring>  // for std::size_t
#include <iostream>
#include <string>
using namespace std;

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/visitors.hpp>
using namespace boost;

typedef boost::property<boost::vertex_name_t, std::string,
                        boost::property<boost::vertex_index_t,
                                        std::size_t> > VertexProperties;
typedef boost::adjacency_list<boost::listS,
                              boost::listS,
                              boost::bidirectionalS,
                              VertexProperties> Graph;  // Graph object type

typedef boost::graph_traits<Graph>::vertex_descriptor Vertex;
typedef boost::graph_traits<Graph>::edge_descriptor Edge;

typedef boost::graph_traits<Graph>::vertex_iterator vertex_iterator;
typedef boost::graph_traits<Graph>::adjacency_iterator adjacency_iterator;
typedef Graph::inv_adjacency_iterator inv_adjacency_iterator;

typedef boost::property_map<Graph,boost::vertex_name_t>::type
  vertex_name_map_t;

class VisitorClass : public dfs_visitor<> {
 public:
  VisitorClass() {}

  template <typename Edge, typename Graph>
  void back_edge(Edge, const Graph&) const {
    cout << "back edge" << endl;
  }
};

int
main() {
  Graph g;
  vertex_name_map_t vertex_names = get(vertex_name, g);
  Vertex v = add_vertex(g);
  Vertex u = add_vertex(g);
  
  vertex_names[v] = string("v");
  vertex_names[u] = string("u");

  bool inserted;
  tie(tuples::ignore, inserted) = add_edge(v, u, g);
  assert(inserted);

  VisitorClass vst;
  depth_first_search(g, visitor(vst));
  // Should not print "back edge", but does.

  return 0;
}