Modify

Ticket #379 (closed Bugs: None)

Opened 9 years ago

Last modified 8 years ago

Investigate other kinds of heaps for dijkstra_shortest_paths

Reported by: dgregor Owned by: dgregor
Milestone: Component: graph
Version: None Severity:
Keywords: Cc:

Description

There are many types of heaps that provide good theoretical 
performance when used as a priority queue, e.g., by Dijkstra's 
shortest paths algorithm. The BGL contains implementations of two 
such data structures: a binary heap and a relaxed heap. The latter is 
used because it has been shown to provide the best overall 
performance. However, we should investigate other kinds of heaps, 
e.g., Fibonacci heaps, relaxed Fibonacci heaps, and run-relaxed 
heaps, to determine which option is best for the BGL.

Dietmar Kuhl implemented several kinds of heaps in his Heaps 
library, which could be found in earlier versions of Boost. It was 
removed from Boost in the 1.27.0 timeframe because it had never 
been reviewed and was not maintained, but may still prove valuable 
for experiments. 

Attachments

Change History

comment:1 Changed 8 years ago by dgregor

  • Status changed from assigned to closed
Logged In: YES 
user_id=249098

"The lore" seems to indicate that relaxed heaps are good enough. If we find 
performance problems later or someone codes a better priority queue, we'll 
consider it at that time.
View

Add a comment

Modify Ticket

Change Properties
<Author field>
Action
as closed
The resolution will be deleted. Next status will be 'reopened'
Author


E-mail address and user name can be saved in the Preferences.

 
Note: See TracTickets for help on using tickets.