Directed Graphs: Traversals and Topological Sorting

CS361: Advanced Data Structures and Algorithms

Algorithm Animation

August 1999

Quick instructions:

• when the animation window appears, select desired operations from the Algorithm menu. In this case, you will probably want to start by generating an array, then viewing one or more of the algorithms.
• When execution pauses inside of an algorithm, press the continue button to resume.

Things to Try:

• Generate a random graph and conduct depth-first and breadth-first searches.
  • Try different starting points and search for different nodes.
  • What happens if the graph contains cycles?
  • What happens if the graph is not connected?
• Generate a random graph and then sort it.
• Try generating graphs with and without cycles and sorting them.
• Try generating graphs that are and are not connected and sorting them.

This animation was prepared using the AlgAE animation framework.

AlgAE applets run under Microsoft Internet Explorer 4.0 (or later) and Netscape Communicator 4.05 (or later).