A slideshow demonstration of the queue-based Topological Sort algorithm. A random graph is generated. As the user clicks through the slides, the various nodes of the graph are colored to show the status of the algorithm. As the topological sort progresses, the nodes that have been "sorted" are printed, and the current contents of the queue are noted.

Simple but effective. The "info" description about the algorithm is probably insufficient for standalone study. But as part of a lecture, this is an effective alternative to drawing an example on the board, and it also can serve to reinforce a textbook or lecture presentation for students at home.

Clicking on the link above will take you the Welcome page for JHAVÉ. Click on the button to WebStart the program. You are given generic login credentials, just hit the "Connect" button. A pulldown menu gives you a wide range of options. Select the desired AV. This will take you to the "Visualizer" window to see that AV itself. Being a WebStart application, the first time you try to run any Jhave exercise, you will have to download the Jhave webstart application. This should happen automatically when you click the link. (You might need to install Java WebStart if it is not on your machine.) Once you download the Jhave application, the AV should start automatically. You can then step through any JHAVE AV by repeatedly clicking the right arrow button. Occasionally, you will be given a multiple-choice or short-answer question to answer.If you don't want to answer the questions, you can turn this off in the Options menu at the top.