On Thu, Jun 30, 2011 at 3:22 PM, David Rajchenbach-Teller <
David.Teller@ens-lyon.org> wrote:

> On 6/30/11 4:07 PM, Alexandre Pilkiewicz wrote:
>
>> I have the impression that none of the proposed solution allows to
>> increase/reduce the priority of an element, which is necessary for the
>> Dijkstra. (But I don't know any that does)
>>
>> - Alexandre
>>
> Are we talking about Dijkstra's graph traversal algorithm?
> If so, there is no need to increase/decrease anything.
>

Exactly, I think in that way as well. (in case if it's shortest path
problem).

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)


> Best regards,
>  David
>

Cheers;
Wojciech