Skip to main content


How to Determine the Shortest Path

In this video, Monica Choe discusses two shortest path algorithms- Dijkstra's algorithm and Bellman-Ford's algorithm. There is a brief overview of graphs and the shortest path problem. Monica walks through examples for each of these algorithms to show exactly how they work. She also provides real-world application to show that these algorithms affect everyone's daily lives.

Project Members: Monica Choe