Dijkstra Searching Algorithms.pptx
Download as PPTX, PDF0 likes1,002 views
Dijkstra's algorithm is used to find the shortest path between a source node and all other nodes in a connected graph. It works by computing the shortest path from one particular source node to all other remaining nodes. The algorithm provides the cost or value of the shortest paths between the source node and all other nodes in the graph, whether directed or undirected.
1 of 10
Download to read offline
More Related Content
What's hot (20)
Ad
More from sandeep54552 (20)
Ad
Recently uploaded (20)
Dijkstra Searching Algorithms.pptx
- 1. Dijkstra Searching Algorithms Shortest Path Algorithms
- 2. Dijkstra Algorithm • It is used for solving the single source shortest path problem. • It computes the shortest path from one particular source node to all other remaining nodes of the graph. • Dijkstra algorithm works only for connected graphs. • It only provides the value or cost of the shortest paths. • Dijkstra algorithm works for directed as well as undirected graphs.