Recommendation: Has Potential.
Description: Demonstrates depth-first search-based topologoical sort algorithm. User steps through the algorithm, and is given some feedback on what is happening at each step.
Evaluation: The feedback could be more clear, to give the user a better idea of what is going on. This AV would be most useful as either a lecture aid, or self-study by somebody who has read about the algorithm and needs to solidify their understanding. In theory, you can add new graphs by creating files external to the program, but in practice most users will need to load one of the supplied data files (though how this is done is not sufficiently clear from the program). One very nice feature of this AV is the fact that you can see the adjacency list or adjacency matrix representations for the graphs. That doesn't help with understanding topological sort, but it does help with understanding those representations.