The seminar uses visualizations that are available at www.algovision.org.
The principal requirement to get credit at the end of the semester is to write a report (4-5 pages) on your work with Algovision: evalution of quality, clarity and other aspects of algorithms that will be shown in the seminer, your suggestions for improvement, bug reports, etc. The report will make it possible for me to know that you worked with Algovision; on the other hand, it is a valuable feedback for future evolusion of visualizations.
24.2. Introduction, shortest paths in an acyklic oriented graph (critical path metod)
26.2. Dijkstra's shortest path algorithm
5.3. Bellman-Ford shortest path algorithm, general scheme for the minimum spanning tree (including the correctness proof)