Make your own free website on Tripod.com
next up previous contents
Next: DynaSpring Algorithm - JAVA Up: 3 Algorithms Previous: Cross Algorithm - JAVA

Spring Algorithm - JAVA

This algorithm tries to set every edge to a specific length. The length of a randomly chosen edge is calculated and then either both edges get closer to each other or move in the other direction. The algorithm also takes care of the number of connections of both vertices and moves the one with less connections more than the other vertex. The longer this algorithm is applied on the graph, the more quiet it gets because every edge has more and more the perfect length. The result is in every case the best distribution of the vertices.




next up previous contents
Next: DynaSpring Algorithm - JAVA Up: 3 Algorithms Previous: Cross Algorithm - JAVA

(k)1998 Graph->O'Mat Team