Dijkstra Algorithm

BY
Javed Siddique
 Dijkstra Algorithm
• Void Dijkstra(Vertex s) {
– Vertex v, w;
– S.dist=0;
– For( ; ;){
• V = smallest unknown distance vertex
• V.known=true;
• For each w adjacent to v
– If ( !w.known)
» {
» If(v.dist + w_via_v < w.dist){
» Decrease (w.dist to v.dist + w_via_v )
» W.path= v
» }
» }
• }
– }
• }
}
 MST Algorithm
• Void Dijkstra(Vertex s) {
– Vertex v, w;
– S.dist=0;
– For( ; ;){
• V = smallest unknown distance vertex
• V.known=true;
• For each w adjacent to v
– If ( !w.known)
» {
» If( w_via_v < w.dist){
» Decrease (w.dist tow_via_v )
» W.path= v
» }
» }
• }
– }
• }
}