This piece of software has been created as a project in the course Informatics IIA at the Institute of Informatics of the University Fribourg (Switzerland). The goal was to develop a program which allows us to draw and automatically rearrange graphs, so that the graph has a minimum of crossings. Therefore we confined ourselfs on undirected graphs in a fixed area. During the third semester we implemented the program in Oberon-2 with the austrian front-end Pow!. In the fourth semester we coded the same (slightly enhanced) program in Java and made it therefore porable in contrast to the Windows version.
You can freely download the precompiled binaries and the sourcecode at
The structure of this project guide and manual is the following. First of all, in the introduction, the course of events during the project development is explained and a short introduction to graphs is given. A second section on page shows the function of the algorithms used in both programs. The different algorithms are explained and a graphical example for each algorithm makes things more clearly.
Because there exist two versions of Graph'O->Mat, this manual consists of two manuals. The manual of the PC version can be found on page and the Java manual begins on page . You will see, that the Java version is newer and therefore has the better algorithms and a better user interface. As conclusion, the last section of this project guide is a summary which you can find on page .