Dijkstra's algorithm is used to find the shortest path between nodes in a graph. It was conceived by computer scientist Edsger W. Dijkstra in 1956. The algorithm finds the shortest path from a source node to all other nodes in the graph. It is commonly used to find driving directions and for routing data packets through networks with minimum delay. The algorithm works by assigning distances or costs to the edges in the graph and finding the path with the lowest cost between two nodes. It cannot handle graphs with negative edges.

1. Dijkstra’s Algorithm
FOUNDED BY E.W. DIJKASTRA

2. Introduction

3. About The Creator

4. Edsger Wybe Dijkstra
1930-2002
“ Simplicity is
prerequisite for
reliability. ”

5. Definition
Dijkstra's algorithm is an algorithm for finding the shortest path
between nodes in a graph, which may represent, for example, road
networks. It was conceived by computer scientist Edsger W. Dijkstra
in 1956 and published in 1959.
The algorithm exists in many variants : Dijkstra's original variant
found the shortest path between two nodes , but a more common
variant fixes a single node as the "source" node and finds shortest
paths from the source to all other nodes in the graph, producing a
shortest path tree.

6. Importance
IN TODAY’S WORLD

7. 1. Dijkstra’s algorithm is applied to automatically find
directions between physical locations, such as
driving directions on websites like Google Maps,
Bing Maps.

8. 1. In many networking or telecommunication applications,
Dijkstra’s algorithm has been used for solving the min-delay
path problem (which is the shortest path problem). For example
in data network routing, the goal is to find the path for data
packets to go through a switching network with minimum delay.

9. Explanation

10. A F
E
D
C
B
5
2
3
3
2
5
4
3
6
A F
E
D
C
B
2
3
3
4
3
To
Problem Solution

13. Let’s write the Algorithm
DEMO........

14. https://github.com/pulkitgoel
96/Dijkstra-s-Algorithm.git

15. Examples
HOW THE ALGORITHM COULD BE USED.....

16. Disadvantages
TO DO: MAKE THEM ADVANTAGES

17. 1.The major disadvantage of the algorithm is the
fact that it does a blind search there by
consuming a lot of time waste of necessary
resources.
2.Another disadvantage is that it cannot handle
negative edges. This leads to acyclic graphs and
most often cannot obtain the right shortest path.

18. References :
• http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
• http://en.wikipedia.org/wiki/Edsger_W._DijkstraWikipedia :
• http://www.codeproject.com/Articles/5707/Dijkstra-
AlgorithmCode project :
• http://en.wikiquote.org/wiki/Edsger_W._DijkstraWikiquote :

19. Presented by:
www.techniblogi
c.com
@pulkitgoel96
Nimish Gupta Pulkit Goel