[pgrouting-dev] likelihoods

[Jay Mahadeokar]

Hi Cathal,

I think if you build your graph with edge costs = 1/actual_cost, the output
path will be as required.
You can then call the dijkstra algorithm as required.

Does this solve your problem?

On Wed, Jun 29, 2011 at 3:23 PM, cathal coffey <coffey.cathal at gmail.com>wrote:

> 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
>
> _______________________________________________
> pgrouting-dev mailing list
> pgrouting-dev at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
>
>


-- 
Regards,
-Jay Mahadeokar
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/pgrouting-dev/attachments/20110629/1bd04605/attachment.html