#DijkstraAlgorithm #ShortestPath #GraphTheory #GreedyAlgorithm #DataStructures #Algorithms #SingleSourceShortestPath #DSA #ComputerScience #Pathfinding #DirectedGraph #UndirectedGraph
Dijkstra’s Algorithm finds the shortest path from a single source to all other vertices in a weighted graph with non-negative edge weights. It uses a greedy approach by always selecting the unvisited node with the smallest known distance.
------------------------------------------------------------------------------
⏱️ TimeStamps :
0:00 - intro Dijkstra Algorithm
0:55 - example - find shortest path
9:45 - limitations - negative edge
