Breaking News: Grepper is joining You.com. Read the official announcement!

Pseudocode of Dijkstra’s Algorithm in C++

Outrageous Ostrich answered on April 9, 2022 Popularity 5/10 Helpfulness 4/10

answer Pseudocode of Dijkstra’s Algorithm in C++

Pseudocode of Dijkstra’s Algorithm in C++

Comment

function dijkstra(G, S)
    for each vertex V in G
        dist[V] <- infinite
        prev[V] <- NULL
        If V != S, add V to Priority Queue Q
    dist[S] <- 0
    
    while Q IS NOT EMPTY
        U <- Extract MIN from Q
        for each unvisited neighbour V of U
            temperoryDist <- dist[U] + edgeWeight(U, V)
            if temperoryDist < dist[V]
                dist[V] <- temperoryDist
                prev[V] <- U
    return dist[], prev[]

Popularity 5/10 Helpfulness 4/10 Language cpp

Source: softhunt.net

Tags: algorithm c++ pseudocode

Link to this answer
Share Copy Link

Contributed on Apr 09 2022

Outrageous Ostrich

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Pseudocode of Dijkstra’s Algorithm in C++

Contents

More Related Answers

Pseudocode of Dijkstra’s Algorithm in C++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.