One doc tagged with "pathfinding"

Dijkstra's algorithm finds the shortest path to every vertex by always expanding the closest