LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation

System Demonstration
  • Lila Behzadi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


LayoutShow is a Java-based multi-threaded applet/application for experimentation with graph drawing algorithms, particularly, force-directed algorithms. The motivation behind the development of this software is the lack of features that would help to experiment, and as a result, understand the behavior of force-directed algorithms in the existing graph drawing software. Some of these features include smooth node-based and iteration-based animations, display of running-time and iteration counts, and variety of initial layout algorithms. LayoutShow supports a number of force-directed graph drawing algorithms as well as layouts based on eigenvectors. Node-based and iteration-based animations have been implemented. In addition, the software provides some algorithms for producing non-random initial layouts for force-directed algorithms. File I/O using GML file format has been implemented. Furthermore, users of LayoutShow applet can choose to perform local file I/O since LayoutShow is a signed applet. To our knowledge, LayoutShow is the first graph drawing software with this feature.


  1. 1.
    L. Behzadi A Cost-oriented Approach to Spring-based Graph Embedding in Layou tShow: a Java Environment for Graph Drawing. Master Thesis, York University, July 1999. Currently available at: http://www.cs.yorku.cs/~lila/work.html.
  2. 2.
    S. Bridgeman, A. Garg, and R. Tamassia. A graph drawing and translation service on the WWW. In Proceedings of Graph Drawing’ 96, pages 45–52. Springer-Verlag, 1997.Google Scholar
  3. 3.
    M. Campione, K. Walrath, and A. Huml. The Java Tutorial Continued: The Rest of the Jdk. Addison-Wesley, Massachusetts, December 1998.Google Scholar
  4. 4.
    A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Proceedings of Graph Drawing’ 94, pages 388–403. Springer-Verlag, 1995.Google Scholar
  5. 5.
    T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21:1129–1164, 1991.CrossRefGoogle Scholar
  6. 6.
    M. Himsolt. GML: A portable graph file format. Technical report, University of Passau, 94030 Passau, Germany, 1997. Currently available at: Scholar
  7. 7.
    M. Himsolt. The Graphlet system. In Proceedings of Graph Drawing’ 96, pages 233–240. Springer-Verlag, 1997.Google Scholar
  8. 8.
    T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7–15, 1989.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    D. Lea. Concurrent Programming in Java. Addison-Wesley, Massachusetts, 1997.MATHGoogle Scholar
  10. 10.
    C. McCreary and L. Barowski. VGJ: Visualizing graphs through java. In Proceedings of Graph Drawing’ 98, pages 454–455. Springer-Verlag, 1999.Google Scholar
  11. 11.
    T. Pisanski and J. Shawe-Taylor. Characterizing graph drawing with eigenvectors. Technical report, Royal Holloway, University of London, 1998. Currently available at:
  12. ]12.
    Sun Microsystems. Java Plug-in Documentation, 1998. Currently available at:
  13. ]13.
    Sun Microsystems. JDK 1.1 Documentation, 1998. Currently available at:
  14. ]14.
    Sun Microsystems. Java Plug-in 1.2 Documentation, 1999. Currently available at:
  15. 15.
    J. Zukowski. Java AWT Reference. O’Reilly and Associates, California, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Lila Behzadi
    • 1
  1. 1.Department of Computer ScienceYork UniversityNorth YorkCanada

Personalised recommendations