Skip to main content


Shortest Path Problem (And Different Ways To Solve It)

In this video, Richard Shyong talks about two shortest path algorithms: Dijkstra's Algorithm and the Bellman-Ford Algorithm. Commonly used in different route finding services, including Google Maps, these algorithms have become a part of our everyday lives. Richard will run through examples (using Nemo!) for both algorithms in order to help you understand how they work.

Project Members: Richard Shyong

Find the program that fits your life.

Learn about our coding, cybersecurity, and data analytics bootcamps offered on full-time and part-time schedules.