如何创建C++ Boost无向图并以深度优先搜索(DFS)顺序遍历它？

#include<boost/graph/adjacency_list.hpp>
#include<boost/graph/depth_first_search.hpp>

typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> Graph;

Graph g(5);

boost::add_edge(0, 1, g);
boost::add_edge(0, 4, g);
boost::add_edge(1, 2, g);
boost::add_edge(1, 4, g);
boost::add_edge(2, 3, g);
boost::add_edge(3, 4, g);

struct dfs_visitor : public boost::default_dfs_visitor {
    void discover_vertex(int v, const Graph& g) const {
        std::cout << "Discovered vertex " << v << std::endl;
    }
};

dfs_visitor vis;
boost::depth_first_search(g, visitor(vis));