Scribd
Upload
15 views7 pages

Dijkstra Algorithm

Uploaded by

narzugekka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
15 views7 pages

Dijkstra Algorithm

Uploaded by

narzugekka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

NAME: MUQADAS

ROLL NO: 124


TOPIC: DISKSTRA ALGORITHM
DESIGN AND ANALYSIS OF ALGORITHM
DIJKSTRA ALGORITHM
• THE DIJKSTRA ALGORITHM IS A POPULAR METHOD USED TO FIND THE
SHORTEST PATH BETWEEN NODES IN A GRAPH, PARTICULARLY IN SCENARIOS
WHERE ALL EDGES HAVE NON-NEGATIVE WEIGHTS. IT OPERATES BY
ITERATIVELY SELECTING THE NODE WITH THE SMALLEST DISTANCE FROM A
SET OF UNVISITED NODES AND UPDATING THE DISTANCES TO ITS NEIGHBORS
ACCORDINGLY. THIS PROCESS CONTINUES UNTIL ALL NODES HAVE BEEN
VISITED OR THE SHORTEST PATH TO THE TARGET NODE IS FOUND.
• THE GREEDY APPROACH AND HEAP SORT IS USE IN DIJKSTRA ALGORITHM.
RELAXATION
• IF ;

• D(U)+C(U,V)<D(V)
• D(V)=D(U)+C(U,V)
EXAMPLE:
ALGORITHM
• DIJKSTRA(GRAPH,SOURCE)
• CREATE VERTEX SET Q
• FOR EACH VERTEX V IN GRAPH
• DIST[V]=INFINITY
• ADD V TO Q
• DIST[SOURCE]=0
• WHILE Q IS NOT EMPTY
• U=EXTRACT-MIN[Q]
• FOR EACH NEIGHBOR V TO U
• RELAX(U,V)
EXAMPLE

You might also like