thelinmichael

LOL! I might be the one asking for help, but that is just a douchebag attitude. As stated in my post, my issue was not that I needed help to understand what Dijkstras algorithm did, but under what conditions it is better to implement the min-priority queue as an ordered array (instead of an array, binary min-heap, fibonacci heap). I'd appreciate if you'd elaborate more on the part I've put in bold.

Hey people. I've got an exam tomorrow about algorithms and data structures, and in spite of my efforts I cannot find the answer to a question from the last exam (it is not at all uncommon for questions to be repeated, weirdly enough). So, the question is about Dijkstra's algorithm, and the implementation of the min-priority queue. I understand when to use an array (dense graphs), binary min-heaps (sparse graphs) and fibonacci-heaps, but I do NOT understand when it is reasonable to use an ORDERED array. Thanks a lot for any pointers or hints. Michael