A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)

  • Arne Frick
  • Andreas Ludwig
  • Heiko Mehldau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)


We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the spring-embedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations. The proposed algorithm achieves drawings of high quality on a wide range of graphs with standard settings. Moreover, the algorithm is fast, being thus applicable on general undirected graphs of substantially larger size and complexity than before [9, 6, 3]. Aesthetically pleasing solutions are found in most cases. We give empirical data for the running time of the algorithm and the quality of the computed layouts.


Local Temperature Undirected Graph Initial Placement Graph Drawing Edge Crossing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    G. Di Battista, P. Eades, H. de Fraysseix, P. Rosenstiehl, and R. Tamassia, editors. Proceedings of the ALCOM International Workshop on Graph Drawing 1993. ALCOM, 1993.Google Scholar
  2. 2.
    G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Report, Brown University, June 1994.Google Scholar
  3. 3.
    R. Davidson and David Harel. Drawing graphs nicely using simulated annealing. Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989. revised July 1993, to appear in Communications of the ACM.Google Scholar
  4. 4.
    P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.Google Scholar
  5. 5.
    C. J. Fisk, D. L. Caskey, and L. E. West. ACCEL: Automated circuit card etching layout. Proceedings of the IEEE, 55(11):1971–1982, November 1967.Google Scholar
  6. 6.
    T.M.J. Fruchterman and E.M. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21, 1991.Google Scholar
  7. 7.
    M. Himsolt. Graphed: A graphical platform for the implementation of graph algorithms. In Proceedings of Graph Drawing '94, LNCS, Princeton, New Jersey, October 10–12 1994. DIMACS Workshop on Graph Drawing, Springer, this volume.Google Scholar
  8. 8.
    N. R. Quinn Jr. and M. A. Breuer. A forced directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377–388, 1979.Google Scholar
  9. 9.
    T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31, 1989.Google Scholar
  10. 10.
    Scott Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.Google Scholar
  11. 11.
    Donald E. Knuth. Seminumerical Algorithms, volume 2. Addison-Wesley, 2nd edition, 1981.Google Scholar
  12. 12.
    J.B. Manning. Geometric symmetry in graphs. PhD thesis, Purdue University, December 1990.Google Scholar
  13. 13.
    N. Metropolis, W. Rosenbluth, M.N. Rosenbluth, and A.H. Teller. Equation of state calculations by fast computer machines. J. Chem. Phys., 21:1087, 1953.Google Scholar
  14. 14.
    D. Tunkelang. A layout algorithm for undirected graphs. In Graph Drawing '93, ALCOM International Workshop PARIS 1993 on Graph Drawing and Topological Graph Algorithms, September 1993.Google Scholar
  15. 15.
    H. Watanabe. Heuristic graph displayer for G-Base. Internationaljournal of Man-Machine Studies, 30:287–302, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Arne Frick
    • 1
  • Andreas Ludwig
    • 1
  • Heiko Mehldau
    • 1
  1. 1.Fakultät für InformatikUniversität KarlsruheKarlsruheGermany

Personalised recommendations