boost - 在 boost::graph 中，如何在给定有向邻接图、顶点和出边索引的情况下获得相邻顶点？

Question

我有一个 adjacency_list 图定义如下：

struct VertexProperties{
    std::string name;
    ...
};
typedef boost::adjacency_list<boost::vecS,
                              boost::vecS,
                              boost::directedS,
                              VertexProperties> GraphType;
typedef GraphType::vertex_descriptor VertexType;

给定一个图、顶点和出边索引，我怎样才能得到相邻的顶点？

Answer 1

解决了：

typedef 
boost::graph_traits<GraphType>::out_edge_iterator
out_edge_iterator;

typedef 
std::pair<out_edge_iterator, out_edge_iterator>
out_edge_iterator_range;

out_edge_iterator_range range = boost::out_edges(current_vertex, graph);
if (out_index > range.second - range.first){
    // out_index is invalid
}
out_edge_iterator iter = range.first + row;

VertexType out_vertex = iter->m_target;