boost graph library adjacency_list: 维护按 EdgeProperties 排序的 EdgeList

Question

我正在尝试使用 std::multiset 容器，该容器在 boost::adacency_list

的 EdgeList 模板参数的 EdgeProperties 上具有严格的弱排序

namespace boost {

struct propOrderedMultisetS { };
template <class ValueType>
struct container_gen<propOrderedMultisetS,ValueType> {
    struct less {
        bool operator() (const ValueType& lhs, const ValueType& rhs) const {
            return (lhs.get_property() < rhs.get_property());
        };
    };
    typedef std::multiset<ValueType, less> type;
};

struct MyVertexProp { int v; };
struct MyEdgeProp {
    bool operator<(const MyEdgeProp& rhs) const {
        return this->weight < rhs.weight;
    }
    double weight;
}

typedef adjacency_list<listS, listS, undirectedS, MyVertexProp, MyEdgeProp,
 no_property, propOrderedMultisetS> PropOrderedGraph;
}

using namespace boost;
int main() {
    PropOrderedGraph g;

    // ... adding some vertices and edges

    for (auto e_range=edges(g); e_range.first != e_range.second; ++e_range.first) {
        // works! prints the edges ordered by weight
        std::cout << g[*e_range.first].weight << std::endl;
    }

    for (auto v_range=vertices(g); v_range.first != v_range.second; ++v_range.first) {
        // works! prints all vertices (random order)
        std::cout << g[*v_range.first].v << std::endl;
    }

    auto first_vertex = *vertices(g).first;
    for (auto adj_v_range=adjacent_vertices(first_vertex, g); adj_v_range.first != adj_v_range.second; ++adj_v_range.first) {
        // problem: dereferencing causes compiler error, see below
        std::cout << g[*adj_v_range.first].v << std::endl;
    }

    return 0;
}

在第三个 for 循环中取消引用迭代器会导致编译器错误：

/usr/include/boost/graph/detail/adjacency_list.hpp:293:69: error: invalid initialization of reference of type ‘MyEdgeProp&’ from expression of type ‘const MyEdgeProp’ inline Property& get_property() { return m_iter->get_property(); }

关于如何修复该错误或如何完成任务的任何想法？

Answer 1

我更改了图形库，现在正在使用 LEMON，它为我的任务提供了一个 class IterableValueMap。

boost graph library adjacency_list: 维护按 EdgeProperties 排序的 EdgeList

boost graph library adjacency_list: maintain EdgeList sorted by EdgeProperties

boost

graph

selector

adjacency-list

c++11