ALGOTUTOR(1)

NAME
algotutor - an interactive program for observing the intermediate steps of algorithms.

SYNOPSIS
algotutor [OPTION] ... FILE

DESCRIPTION
algotutor is an interactive program for observing the intermediate steps of algorithms. The target audience is computer science students and/or anyone who studies algorithms and/or data structures. One can create data files in plain text format (actually perl anonymous hashes, but one need not care) and let algotutor runs through some predefined algorithm. Then one can step backward and forward through the execution sequence of the algorithm at different levels of details. It requires perl-Tk.

OPTIONS

-a ALGO
    Runs the algorithm ALGO. Currently ALGO can be one of:

    bst operations on binary search trees
    bst operations on red-black trees (remove() is not implemented yet)
    heap operations on heaps -- the remove operation on a heap always removes the top element regardless of the argument
    dfs depth first search on graphs
    bfs breadth first search on graphs
    prim Prim's minimal spanning tree on graphs
    dijk Dijkstra's single-source shortest path on graphs
    flwa Floyd-Warshall's all-pair shortest path on graphs (very, very slow)
    dom 2-dimensional point domination
    graham Graham's scan for convex hull
-s VERTEX
    Use VERTEX as the starting vertex (for dfs, bfs, prim, and dijk)

LICENSE
This code is distributed under the GNU General Public License

AUTHOR
Chao-Kuei Hung ckhung AT cyut DOT edu DOT tw

SEE ALSO
Please see /usr/share/doc/algotutor/doc/ for the full set of documentations.