Drawing graphs by numerical solution of a system of second order ordinary differential equations
Mohammad ali Ebrahimi and Michael Monagan
In this poster we present the spring algorithm for drawing directed and undirected graphs of vertices and edges in 2D or 3D. Starting from random initial position for the vertices, the algorithm finds the minimal total energy of the graph. While graph drawing is a complicated problem, this algorithm requires no special knowledge about graph theory. The Maple implementation of this algorithm will be used by the Graph Theory Package. We will demo a Maple implementation of the spring algorithm.