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

Products You May Like

Articles You May Like

13532385396179 – Numberphile
3 Weird Things That Domestication Did to Dogs
Could You Recover From Illness … Using Your Own Stem Cells? @TED #ted #shorts
How close are we to eradicating HIV? – Philip A. Chan
Dealing Cards with Cryptography (with Ron Rivest) – Numberphile

Leave a Reply

Your email address will not be published. Required fields are marked *