在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;