[pgrouting-dev] likelihoods

[cathal coffey]

Hey Guys,

I have a pgrouting question.

Dijkstra returns the shortest path i.e. it chooses a path which minimizes
the edge costs.
Is there an algorithm that chooses a path which maximizes the edge cost? I
have my edge costs stored as likelihoods (so the higher the better).

Cathal
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/pgrouting-dev/attachments/20110629/611f7ea9/attachment.html