Consider the problem of finding the shortest path between ... visit next, use what’s called a greedy strategy: Go to whichever is closest to the source according to your current estimate. With ...

If you haven't heard of Dijkstra's algorithm before, the idea is that the algorithm can be used to calculate the shortest path between ... use cases but is commonly used for maps and path finding ...