迭代const boost :: graph的边权重

时间:2012-09-19 19:02:19

标签: c++ boost-graph

我需要遍历图形的边缘并检查每条边的权重。我没有修改边缘,因此我的函数对图形采用const引用。但是,我知道获得边权重的唯一方法是访问属性映射,这似乎违反了常量。

void printEdgeWeights(const Graph& graph) {
  typedef Graph::edge_iterator EdgeIterator;
  std::pair<EdgeIterator, EdgeIterator> edges = boost::edges(graph);

  typedef boost::property_map<Graph, boost::edge_weight_t>::type WeightMap;
  // The following line will not compile:
  WeightMap weights = boost::get(boost::edge_weight_t(), graph);

  EdgeIterator edge;
  for (edge = edges.first; edge != edges.second; ++edge) {
    std::cout << boost::get(weights, *edge) << std::endl;
  }
}

所以我必须这样做:

Graph& trust_me = const_cast<Graph&>(graph);
WeightMap weights = boost::get(boost::edge_weight_t(), trust_me);

有没有办法避免这种情况?

另一方面,属性地图查找是否是恒定时间?

供参考,这是我对Graph的定义。

struct FeatureIndex { ... };
typedef boost::property<boost::vertex_index_t, int,
                        FeatureIndex>
        VertexProperty;
typedef boost::property<boost::edge_index_t, int,
        boost::property<boost::edge_weight_t, int> >
        EdgeProperty;
typedef boost::subgraph<
          boost::adjacency_list<boost::vecS,
                                boost::vecS,
                                boost::undirectedS,
                                VertexProperty,
                                EdgeProperty> >
        Graph;

谢谢!

1 个答案:

答案 0 :(得分:5)

为了将来的参考,我发现了它。这不起作用

const boost::property_map<Graph, boost::edge_weight_t>::type

但是property_map定义了一个const_type

boost::property_map<Graph, boost::edge_weight_t>::const_type

get()的文档在此页面上: http://www.boost.org/doc/libs/1_51_0/libs/graph/doc/adjacency_list.html