I am using a priority_queue-s for implementing A* and Dijkstra's algorithm. Is there a point writing my own heap for time optimization? How faster would it be? I read in wikipedia that Fibonacci heap will be the best. Do you agree?
The_Purple_Mask
0
Newbie Poster
Recommended Answers
Jump to PostAlso, a word of warning if you are using MS Visual Studio:
VS has a lot of runtime checks built in their debug implementation of STL, so if you run it under debug it will most likely feel terribly slow.
In my case it came out when I …
All 3 Replies
deceptikon
1,790
Code Sniper
Team Colleague
Featured Poster
jaskij
45
Junior Poster in Training
mike_2000_17
2,669
21st Century Viking
Team Colleague
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.