Adocs: a drawing system for generic combinatorial structures

  • François Bertault
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)


Existing graph drawing systems imply the use of specific algorithms for each kind of data structures. This paper provide a description of the Adocs program. The program is based on a generic description of the structures, and thus allows to draw structures of an infinite number of classes. It can be used in order to produce graphical output for Gaïa, an uniform random generator of combinatorial structures. It could be used with other programs and is well suited for drawing compound objects.


  1. 1.
    Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1–2):1–35, 1994.CrossRefGoogle Scholar
  2. 2.
    Eades Peter D. Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5(2):10–36, 1992.Google Scholar
  3. 3.
    Edward M. Reingold and John S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223–228, March 1981.Google Scholar
  4. 4.
    Paul Zimmermann. Gaïa: a package for the random generation of combinatorial structures. MapleTech, 1(1):38–46, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • François Bertault
    • 1
  1. 1.INRIA LorraineVillers-les-NancyFrance

Personalised recommendations