Boost Graph Library中选择给定顶点的随机输入或输出邻居的有效方法？

#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_traits.hpp>

int main() {
    // 定义图类型
    typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> Graph;

    // 创建图
    Graph g;

    // 添加顶点
    boost::add_vertex(g);
    boost::add_vertex(g);
    boost::add_vertex(g);
    boost::add_vertex(g);

    // 添加边
    boost::add_edge(0, 1, g);
    boost::add_edge(0, 2, g);
    boost::add_edge(0, 3, g);

    // 获取顶点迭代器类型
    typedef boost::graph_traits<Graph>::vertex_iterator vertex_iterator;

    // 遍历图中的顶点
    std::pair<vertex_iterator, vertex_iterator> vp;
    for (vp = boost::vertices(g); vp.first != vp.second; ++vp.first) {
        // 获取当前顶点
        Graph::vertex_descriptor v = *vp.first;

        // 获取邻居迭代器类型
        typedef boost::graph_traits<Graph>::adjacency_iterator adjacency_iterator;

        // 遍历当前顶点的邻居
        std::pair<adjacency_iterator, adjacency_iterator> neighbors = boost::adjacent_vertices(v, g);
        for (adjacency_iterator neighbor = neighbors.first; neighbor != neighbors.second; ++neighbor) {
            // 输出邻居顶点
            std::cout << "Neighbor: " << *neighbor << std::endl;
        }
    }

    return 0;
}