Downloaded 280 times
Uploaded bymansab MIRZA
Dijkstra s algorithm
Dijkstra's algorithm is a solution to the single-source shortest path problem in graph theory. It finds the shortest paths from a source vertex to all other vertices in a weighted graph where all edge weights are non-negative. The algorithm uses a greedy approach, maintaining a set of vertices whose final shortest path from the source vertex has already been determined.
More Related Content
![[DSC Europe 25] Andjelka Kovacevic - AI for the Deep Universe.pptx](https://cdn.slidesharecdn.com/ss_thumbnails/xdw54gniqhaq5svygbww-1-andjelka-kovacevic-ai-for-deep-universe-251203092157-8a1082b1-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Nikola Rajovic - Hardware Technologies Under the Hood: RISC-V...](https://cdn.slidesharecdn.com/ss_thumbnails/o2gptrmtoyqndgoshwgq-dsc2025-tenstorrent-rajovic-251205090438-814685f5-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Dusan Jovicic - AI Story: From on-prem to cloud and back agai...](https://cdn.slidesharecdn.com/ss_thumbnails/8kp49m6uq22ifnbwhfnk-2-251205085715-964d11a6-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Bogdan Daniel Maruneac - AI - It starts with you.pptx](https://cdn.slidesharecdn.com/ss_thumbnails/odov3snhrcqs9hx5ny2n-4-251205085715-f1daacfe-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Jim Sterne - Adopting Generative AI Capabilities Into the Ent...](https://cdn.slidesharecdn.com/ss_thumbnails/sxhpofuorcagxsaulkmt-3-251204082258-7e66bc48-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Yemi Olagbaiye - From Senses to Systems: Building Organisatio...](https://cdn.slidesharecdn.com/ss_thumbnails/zhgiesqoqd68z6lkos3o-5-251203092157-dcce0c99-thumbnail.jpg?width=640&height=640&fit=bounds)
Dijkstra s algorithm
- 1.
- 2. Single-Source Shortest PathProblem Single-Source Shortest Path Problem - The problem of finding shortest paths from a source vertex v to all other vertices in the graph. 2
- 3. Dijkstra's algorithm Dijkstra's algorithm- is a solution to the single-source shortest path problem in graph theory. Works on both directed and undirected graphs. However, all edges must have nonnegative weights. Approach: Greedy Input: Weighted graph G={E,V} and source vertex v∈V, such that all edge weights are nonnegative Output: Lengths of shortest paths (or the shortest paths themselves) from a given source vertex v∈V to all other vertices 3
- 4. Dijkstra's algorithm -Pseudocode 4
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20. Dijkstra Animated Example-2 ShortestPath from A to H, A to C, C to D, D to E, E to G, G to F, F to H 20
- 21.