Rocs is a Graph Theory IDE for everybody interested in designing and analyzing graph algorithms. (For more information please refer to the Rocs handbook or the website). In this task, two example algorithms shall be implemented for demonstrating Rocs.

The Task: For both algorithms

• Breadth first search and
• Prim's spanning tree algorithm

create projects and implement the algorithms such that the projects can be used to illustrate the behavior of the algorithms. In detail, this includes implementation of the algorithm, testing of your implementation, and creating of a meaningful graph that is suited for illustrating the algorithm. Further, add useful pauses to the algorithm (see interrupt() in the handbook) and prepare a journal file that explains how the algorithm changes the graph when being executed. The result should allow a student who is not familiar with those algorithms, to understand how they work.

Additional Information: Please use the current Rocs version from GIT master. For details how to obtain this, see http://techbase.kde.org/Projects/Edu/Rocs.