Computer

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: https://youtu.be/EUrU1y5is3Y
Slow Loris Attack: https://youtu.be/XiFkyR35v2Y

http://www.facebook.com/computerphile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: http://bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com

Products You May Like

Articles You May Like

10 Times Sεx Killed Someone!
Evolution of Display Technology [1940 – 2020]
29 Facts about European Royalty – mental_floss List Show Ep. 520
Calculate the shaded area
I Can Guess Your Card – Why It Works

Leave a Reply

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