16.boost图深度优先遍历DFS

 #include <iostream>
 #include <boost/config.hpp>
 //图(矩阵实现)
 #include <boost/graph/adjacency_matrix.hpp>
 #include <boost\graph\graph_utility.hpp>
 #include <boost/graph/graph_traits.hpp>
 //图(链表实现)
 #include <boost/graph/adjacency_list.hpp>
 //求最小生成树
 #include <boost/graph/kruskal_min_spanning_tree.hpp>
 //prim算法求最小生成树
 #include <boost/graph/prim_minimum_spanning_tree.hpp>
 //深度优先遍历
 #include<boost/graph/depth_first_search.hpp>
 using namespace std;
 using namespace boost;

 //顶点名称
 enum { A, B, C, D, E, F, G, H };
 //顶点个数
 #define N 6
 const char *name = "ABCDEF";

 //宏定义
 typedef adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, int>> mygraph;
 typedef property<edge_weight_t, int> EWP;

 class DFSmyv :public boost::default_dfs_visitor
 {
 public:
     //当前在哪个结点
     template<typename vertex,typename Graph>
     void discover_vertex(vertex v, Graph g) const
     {
         cout << "at" << v << endl;
     }

     //输出当前结点下一个要访问的结点
     template<typename Edge,typename Graph> const
     void examine_edge(Edge e, Graph g)
     {
         cout << "edges" << e << endl;
     }
 };

 //无向图
 void main()
 {
     //图,每个结点是vec来实现,无向图,有边长与权重的属性
     mygraph myg;
     add_edge(A, B,, myg);
     add_edge(B, C, ,myg);
     add_edge(A, C,, myg);
     add_edge(A, D,, myg);
     add_edge(C, D,, myg);
     add_edge(B, D,, myg);
     add_edge(B, E, , myg);
     add_edge(B, F, , myg);
     add_edge(B, G, , myg);
     add_edge(B, H, , myg);
     DFSmyv myd;
     depth_first_search(myg, visitor(myd));

     cin.get();
 }