Wojciech Meyer wrote: > And if one does not need performance but understanding what's the purpose of the priority queue is, > what is the interface, and how it should behave, than implementation as a list is sufficient. Please note > it is for exam and major pressure is put on Dijkstra not on implementation or performance (as far as I > understood) of the priority queue. (which can be changed later easily)
Not really. This is a practical exam. 3h and a half facing a computer, with a set of problems to solve, with huge inputs. Hence the need for performance.
Here, Dijkstra's algorithm is only going to be a step in the process of solving a more elaborate problem. Not having a priority queue readily available means that I am going to have to waste some time reimplementing an efficient structure.
The Set option covers some cases (and it does work in the case of Dijkstra) ; but in other cases it won't work :/ -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
