|
|
Abteilung Betriebssysteme und Verteilte Systeme |
|
| Author: | Falk Tintemann |
| Title: | Animation von Paarbildungalgorithmen |
| Kind of Publication: | Diplomarbeit |
| Supervisor: | Prof. Stiege |
| Date: | January 1998 |
| Institution: | Universität Hildesheim, Institut für Betriebssysteme und Rechnerverbund |
| Pages, Language | 490, German |
| Keywords: | Matchings, animation of algorithms |
| CR Classification: | G.2.2 [Graph Theory]: Graph algorithms; |
| General Terms (ACM): | Algorithms |
Animation is a useful method for the explanation of algorithmic runs. Of course, it is necessary to have the right tools. For this reason an extensive animation system is designed and implemented within the scope of this dissertation. The system is founded on a client/server architecture and has a general functionality. The special functionality has to come from the clients. For demonstration of the animating system a special client is implemented to animate the Gale-Shapley algorithm for the stable marriage problem. This problem is part of stable matching problems which are presented in the theoretical section of this work. The dissertation is split into three parts. The first part describes the problem and the solution found in general. The second part contains the user and programming manual. Source code listings are the content of the third part.
|
Last change: Oct 3 1998 Stiege |