circo
After Six and Tollis 199912, Kauffman and Wiese 20023.
This is suitable for certain diagrams of multiple cyclic structures, such as certain telecommunications networks.
Attributes for circo features
- mindist – Specifies the minimum separation between all nodes. Valid on: Graphs.
- root – Specifies nodes to be used as the center of the layout. Valid on: Graphs, Nodes.
- normalize – normalizes coordinates of final layout. Valid on: Graphs.
- oneblock – Whether to draw circo graphs around one circle.. Valid on: Graphs.
- overlap_scaling – Scale layout by factor, to reduce node overlap.. Valid on: Graphs.
- voro_margin – Tuning margin of Voronoi technique. Valid on: Graphs.
-
Six J.M., Tollis I.G. (1999) A Framework for Circular Drawings of Networks. In: Kratochvíyl J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. ↩︎
-
Six J.M., Tollis I.G. (1999) Circular Drawings of Biconnected Graphs. In: Goodrich M.T., McGeoch C.C. (eds) Algorithm Engineering and Experimentation. ALENEX 1999. Lecture Notes in Computer Science, vol 1619. Springer, Berlin, Heidelberg. ↩︎
-
Michael Kaufmann, Roland Wiese (2002) Embedding Vertices at Points: Few Bends suffice for Planar Graphs. In: Journal of Graph Algorithms and Applications. vol. 6, no. 1, pp. 115–129 ↩︎
© 2025 The Graphviz Authors
Licensed under the Eclipse Public License 1.0.
https://www.graphviz.org/docs/layouts/circo/
