Learn more advanced front-end and full-stack development at: [ Ссылка ]

The Shortest Path Problem is the problem of finding a path between two nodes in a graph so that the total sum of the edges is minimized. In this Pathfinding Tutorial, we walk through examples for both Bellman-Ford and Dijkstra's algorithm to show how to find the shortest path in a graph.

Watch this video to learn:

- An overview of graphs and the shortest path problem
- How to find the shortest path using Dijkstra's algorithm
- How to find the shortest path using the Bellman-Ford algorithm

свернуть