Dijkstra's Algorithm with Solved Example | Method 1 for Shortest Path in urdu/hindi

In this video Dijkstra's Algorithm with Solved Example has been explained in detail. Dijkstra algorithm is greedy approach algorithm. It is used to find out shortest path between source node and destination node in weighted graph.The worst case time complexity of Dijkstra algorithm is O (n2).The steps of algorithm are Step 1: Remove all loops Step 2: Remove all parallel edges between two Nodes (vertices) In case of parallel edges, keep the one which has the least weight Step 3: Create a weighted matrix table 3(a): set 0 value to the source vertex & infinite value to remaining vertices 3(b): mark smallest unmarked value in matrix table & and mark that vertex visited 3(c): find and update those vertices which are directly connected to mark (visited) vertices For update: minimum (old destination value, marked value + edge weight) Repeat 3(b) & 3 (c) for all vertices az computing Dijkstra Algorithm - Single Source Shortest Path - Greedy Method Dijkstra Algorithm single source shortest path Dijkstra's Shortest Path Algorithm Dijkstra’s Shortest Path Algorithm Dijkstra's Algorithm Dijkstra's Algorithm in urdu Dijkstra's Algorithm in hindi Dijkstra's Algorithm method 1 Dijkstra's Algorithm example what is Dijkstra's Algorithm dijkstra's algorithm dijkstra dijkstra algorithm algorithm dijkstra's dijkstra algorithm discrete greedy algorithm dijkstras shortest path algorithm ,dijkstras single source shortest path algorithm, shortest path algorithm dijkstra's example single source algorithm dijkstras eager dijkstra, dijkstras example dijkstra example #AzComputing #DijkstraAlgorithm #DijkstraExample