Showing posts with label Dijkstra. Show all posts
Showing posts with label Dijkstra. Show all posts

Wednesday, 19 May 2010

Shortest Path – Dijkstra’s Algorithm

We’ve all used those horrible SATNAV’s to get from one place to another. But how do they calculate the path we must follow in order to minimize the time needed.

This is a shortest distance problem, which shall be covered in this post via Dijkstra’s Algorithm.