Make your own free website on Tripod.com
next up previous contents
Next: Cross Algorithm - JAVA Up: Standard Algorithm - PC/JAVA Previous: Double Circle Algorithm -

Centered 2-Circle Algorithm - PC/JAVA

  figure83
Figure 6: The 'Centered 2-Circle' algorithm applied on the graph (PC)

First of all, the vertex with most connections is place in the middle of the workspace. The rest of the vertices is placed in two shifted circles around the first. Then the 'Standard' algorithm is applied on them. Of course, the former layout of the graph is destroyed, but this layout is fine for use with homogenous connected vertices where one of the vertices has many more connection than the others.


next up previous contents
Next: Cross Algorithm - JAVA Up: Standard Algorithm - PC/JAVA Previous: Double Circle Algorithm -

(k)1998 Graph->O'Mat Team