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.
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.
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.
Born (1930-05-11)11 May 1930Rotterdam, Netherlands
Died 6 August 2002(2002-08-06) (aged 72)Nuenen, Netherlands
Known for Dijkstra's algorithm
Structured programming
THE multiprogramming system
Semaphore
Notable awards Turing Award (1972)
Association for Computing Machinery
Dijkstra Prize (2002)
For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined.
Importance of Dijkstra’s algorithm is in many more problems than you might can think, it can be cast in many shortest path problems, making Dijkstra’s algorithm a powerful and general tool.
To do:
Go from promlem to solution step by step on green board