16 Mar
2007
16 Mar
'07
1:01 p.m.
On Mar 16, 2007, at 6:00 AM, Florian Teichert wrote:
At the moment I search an unsorted linear list O(|V|) times -- so I would benefit from every other structure ... what would you suggest? Some standard binary heap? The mutable_queue looked good to me but this one is pending, too ...
Both the mutable_queue and the relaxed_heap are well-tested and should improve performance over your list-based implementation. Cheers, Doug