Dijkstra

Dijkstra's algorithm is a graph search algorithm that will find the cheapest path between two node in a graph (if one exists).

Normally for pathfinding we use A* because it can be quicker while still finding the same path.

Pseudo Code


function Dijkstra(node start,node goal)
{
...
}