[GraphHopper] Dijkstra's Algorithm not getting destination node

[Peter K]

Hi Zongjie,

> it just stopped like halfway.

All algorithms should work properly. If not, feel free to create a new
issue with a failing unit test which shows your problem.


> By the way, how can I retrieve the geopoints of the edgeiterator?

See edgeIterator.wayGeometry(), but why not use the API as it is shown
in the unit tests which means via the Path class?
See AbstractRoutingAlgorithmTester where e.g. DijkstraBidirectionRefTest
is one subclass which tests DijkstraBidirectionRef.

Regards,
Peter.

> Hi Peter,
>
> I have tried using the basic dijkstra's algorithm found in your master
> copy, but it does not seem to return me a full path of nodes to the
> destination node. it just stopped like halfway. Is there any solution
> for this? Im currently gonna test out the dijkstrabidirectionalref
> found on your master copy and see if does give me the full path.
>
> By the way, how can I retrieve the geopoints of the edgeiterator? I
> can only get the distance. and does the distance refers to the
> distance between the neighbour node and the current node?
>
> Thank you for your time and hope to receive your kind response soon!
>
> Best Regards,
> Zongjie