Here we look at Dijkstra’s Algorithm, a topic in graph theory.
Dijkstra’s Algorithm is concerned with finding an optimal path in regards to minimizing ‘cost’ associated with traveling along edges in a graph.
In this video on Dijkstra’s Algorithm I use the algorithm to find an optimal path.
Dijkstra’s Algorithm is a topic one could expect to see in discrete math, graph theory, computer science, etc..
