This section explains you the different behaviour of the implemented graph placing algorithms. Because the Java version is newer than the PC implementation, there are more different placing algorithms included. Actually you can see in the title of the section in which version of Graph'O->Mat this algortihms can be found. In addition to each algorithm you can find a screenshot of an example graph which was randomly generated (see figure 1). This shows you the layout of the different algorithms at a glance. The division in different subsections is made for better seeing the inheritage of the algorithms. That means, that the algorithms in the subsections are derivates from the main algorithm.
Figure 1: A randomly generated graph (PC)