$\begingroup$

Can anyone provide a simple explanation of Dijkstra's Algorithm?

My text, discrete mathematics with applications by Susanna Epp provides a very complex explanation of the algorithm that I cannot seem to decipher:

I want to use the algorithm in order to solve this Review Question we have for our final:

$\endgroup$ 2

1 Answer

$\begingroup$

The best way to get a "feel" for the algorithm, is to see it in action on several simple examples. (At least in my opinion.)

The best way I know how to do this is the following webpage:

EDIT: The page is now available in English:

(Thank you to the person who pointed this out to me.)

The only problem is that it is in German, so you might need to use Google Translate on it. I will try to describe to you the steps you need to use it:

Click "Fertig! Weiter zum Algorithmus" (Ready! On to the algorithm!)

Then click on one of the nodes ("Wähle zuerst einen Startknoten aus!" "First choose a start node!")

Then click "Nächster Schritt" (Next step) until the algorithm terminates.

You can also use it on different graphs besides the example first offered on the page; if you need clarifications on the translation let me know.

$\endgroup$ 4

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password Submit

Post as a guest

Post Your Answer Discard

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy