Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory

Transcript

hey everyone and welcome to this video on dijkstra's shortest path algorithm suppose you have a graph connected by weighted edges like this one then dijkstra's algorithm allows you to calculate the shortest path from a fixed node to every other node this can be applied for example in digital mappings so suppose those nodes are cities and the edges ... Read More