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.
Best regards,
David
--
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
