**Figure 2:** *The 'Standard' algorithm applied on the graph (PC)*

The implemented optimization algorithms of the PC version base all on the first algorithm selectable in the optimize menu. It is called the 'Standard' algorithm. This basic algorithm selects two random vertices and calculates the length of all connected edges of those two vertices. Then these two vertices are exchanged and the length newly calculated. If the new length is shorter, the vertices are left exchanged, otherwise they will be swapped back to their former position. This results in a graph with short edges and therefore - in most cases - lesser crossings. The layout of the graph remains the same after applying this algorithm. It only changes the position of the vertices among themselves. That means, that the numbering of the graph remains not the same, but the coordinates.

- Circle Algorithm - PC/JAVA
- Centered Circle Algorithm - PC
- Double Circle Algorithm - PC
- Centered 2-Circle Algorithm - PC/JAVA