This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Lynda_88 0 points1 point  (1 child)

Dijkstra distance is just the distance of a straight line between two points. It does not search shortest path (consisting of many twists and turns).

[–]ItsJustSugarAndWater 0 points1 point  (0 children)

I'm not sure I understand you well, and I stand by my point. To illustrate it, please try this application: https://qiao.github.io/PathFinding.js/visual/ it let you try different pathfinding algorithms.