Finding the Best Path (Dijkstra's Algorithm)

How does a program find the optimal route between two points? This problem comes up in map apps, networking, and lots of other situations. One way to solve it is known as Dijkstra's algorithm. I put all the code at the end of the video, so if you're a non-programmer you can watch up to then to get the general idea.

This is another viewer-suggested topic--feel free to suggest others.

If you like this video and you want to learn more about how computers do what they do without learning programming, check out my How Software Works book: http://vantonspraul.com/HSW

If you want to read more about my programming concepts, check out my "Think Like a Programmer" book. If you've found that you are able to read programs and understand programming language syntax but aren't always confident writing programs from scratch, my book can help.

For more information on the book head to one of these:
Amazon page for the book: http://amzn.to/1MZlmlY
My site: http://www.vantonspraul.com/TLAP
My publisher's site: http://nostarch.com/thinklikeaprogrammer

Connect with me:
My site: http://vantonspraul.com
Twitter: https://twitter.com/VAntonSpraul
Facebook: https://www.facebook.com/ThinkLikeAProg

Видео Finding the Best Path (Dijkstra's Algorithm) канала V. Anton Spraul