Abstract
We present additions to the widely-used layout method for directed acyclic graphs of Sugiyama et al. that allow to better utilize a prescribed drawing area. The method itself partitions the graph’s nodes into layers. When drawing from top to bottom, the number of layers directly impacts the height of a resulting drawing and is bound from below by the graph’s longest path. As a consequence, the drawings of certain graphs are significantly taller than wide, making it hard to properly display them on a medium such as a computer screen without scaling the graph’s elements down to illegibility. We address this with the Wrapping Layered Graphs Problem (WLGP), which seeks for cut indices that split a given layering into chunks that are drawn side-by-side with a preferably small number of edges wrapping backwards. Our experience and a quantitative evaluation indicate that the proposed wrapping allows an improved presentation of narrow graphs, which occur frequently in practice and of which the internal compiler representation SCG is one example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
Note that this does not relate to the number of cuts but to the number of edges that span a certain cut index.
References
Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 409–453. CRC Press (2013)
Rüegg, U., Ehlers, T., Spönemann, M., von Hanxleden, R.: Generalized layerings for arbitrary and fixed drawing areas. J. Graph Algorithms Appl. 21(5), 823–856 (2017)
Rüegg, U., von Hanxleden, R.: Wrapping layered graphs. Technical report 1803, Kiel University, Department of Computer Science, February 2018. ISSN 2192–6247
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109–125 (1981)
von Hanxleden, R., Duderstadt, B., Motika, C., Smyth, S., Mendler, M., Aguado, J., Mercer, S., O’Brien, S.: SCCharts: sequentially constructive statecharts for safety-critical applications. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2014), Edinburgh, UK. ACM, June 2014
Acknowledgement
This work has been supported in part by the German Science Foundation, as part of the Compact Graph Drawing with Port Constraints (ComDraPor, DFG HA 4407/8-1) project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Rüegg, U., von Hanxleden, R. (2018). Wrapping Layered Graphs. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds) Diagrammatic Representation and Inference. Diagrams 2018. Lecture Notes in Computer Science(), vol 10871. Springer, Cham. https://doi.org/10.1007/978-3-319-91376-6_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-91376-6_72
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91375-9
Online ISBN: 978-3-319-91376-6
eBook Packages: Computer ScienceComputer Science (R0)