How to apply Dijkstra algorithm to my adjacency graph?

StackOverflow https://stackoverflow.com/questions/20589797

Question

i have a programming assignment that require me to build an adjacency graph and applied Dijkstra algorithm to find a MST. I have build my adjacency graph, but i dont know how to apply the Pseudo-code for the Dijkstra algorithm. The link had the code for adjacency list, http://www.cs.utsa.edu/~wagner/CS3343/newgraph/graphrep.html

The Pseudo-code for the Dijkstra algorithm: http://i.imgur.com/TtPARzW.png

Is there anyway to applied the Dijkstra algorithm for this graph? Thank you very much!!

Was it helpful?

Solution

To apply pseudo code you typically code it up in some language and then run the code.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top