[pgrouting-users] Question to dijkstra-algorithm

[Stephen Woodbridge]

Kai,

Thanks! this is a good explaination of how things work and how one might 
work around oddities like the one you ran into.

I would be nice if Kai's pages were linked to a FAQ of some other 
support info.

Thanks again,
   -Steve

Kai Behncke wrote:
> Dear users,
> 
>> meanwhile I get deeper and deeper in pgrouting, but there is still one problem:
> 
> 
>> You can see here, that with pg_dijkstra not the "real" shortest ways is visualized:
> 
>> http://www.kneipenculture.de/not_the_shortest_way.png
> 
> 
>> Well, of course, for pgdijkstra this is the shortest (it goes from startedge[source]=8079 to endedge[target]=8326.
> 
>> But I would like to get the "green" route (and not the red one).
> 
>> What would you recommend?
> 
> 
> that problem is solved now, a description of that can be found here:
> 
> http://pgrouting.postlbs.org/wiki/killing_some_bugs
> 
> (well it wasn`t a bug of pgrouting, it was more a bug of the tutorial).
> 
> here:
> http://pgrouting.postlbs.org/wiki/killing_some_bugs_source_code
> 
> and here:
> 
> http://pgrouting.postlbs.org/wiki/killing_some_bugs_source_code_explanation
> 
> Best regards, Kai
> 
> 
> 
>