Dijkstra’s Algorithm - Computerphile

Dijkstra’s Algorithm finds the shortest path between two points. Dr Mike Pound explains how it works. How Sat Nav Works: Slow Loris Attack: This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: Computerphile is a sister project to Brady Haran’s Numberphile. More at