3

我正在使用 Fibonacci heap(boost) 对元素数组进行排序，但我无法遍历堆。代码是这样的：

#include <deque>
#include <boost/heap/fibonacci_heap.hpp>
#include <iostream>

struct MyData {
     ...
     long int id;

     ...
}; 

struct MyCompare{
    bool operator()(const deque<MyData> &a, const deque<MyData> &b) const
    {
        return a[a.size()-1].id > b[b.size()-1].id;
    }
};


int main()
{   deque<MyData> array1;
    deque<MyData> array2;

    MyData app;
    app.id=15;
    array1.push_front(app);
    app.id=10;
    array1.push_front(app);

    app.id=5;
    array2.push_front(app);
    app.id=2;
    array2.push_front(app);

    boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> > fib_heap;  
    fib_heap.push(array1);
    fib_heap.push(array2);
    boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator it;
    boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator beg =fib_heap.begin();
    boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator end =fib_heap.end();

    for (it=beg;it!=end; ++it) {
        deque<MyData> elem;
        elem =*it;
        for (int k=0;k < elem.size();k++)
            cout<<" "<<elem[k].id;
        cout<<"\n";         
    }


}

它在“elem = *it”行给了我这个错误：recursive_tree_iterator 实例化错误：recursive_tree_iterator(void): adapter_type(0) {}

有没有办法做到这一点？或者使用另一个有序堆而不是斐波那契？非常感谢。

4

1 回答 1

0

我认为错误在于您不能默认构造迭代器。尝试消除it变量的创建并将其移动到 for 循环中：

boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator beg =fib_heap.begin();
boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator end =fib_heap.end();

for (boost::heap::fibonacci_heap<deque<MyData>, boost::heap::compare<MyCompare> >::iterator it=beg;it!=end; ++it) {
    deque<MyData> elem;
    elem =*it;
    for (size_t k=0;k < elem.size();k++)
        cout<<" "<<elem[k].id;
    cout<<"\n";         
}

为了按堆顺序迭代，您可以使用：

ordered_iterator ordered_begin(void) const;
ordered_iterator ordered_end(void) const;

另外，我认为代码将受益于使用auto关键字：

for (auto it=fib_heap.begin(), end=fib_heap.end();it!=end; ++it) {
    deque<MyData> elem;
    elem =*it;
    for (size_t k=0;k < elem.size();k++)
        cout<<" "<<elem[k].id;
    cout<<"\n";         
}
于 2017-07-23T20:02:42.260 回答