Detailed Examples of Figure Preparation in the Two Most Common Graph Layouts
Source abstract
Abstract
Graphs are an excellent tool with applications in various branches of engineering. Graph layouts have emerged as a cornerstone in the visual representation and analysis of complex systems. They are indispensable in reducing complexity, optimizing designs, improving communication, and enhancing problem-solving capabilities. They transform abstract concepts and data into visual formats that are easier to interpret, analyze, and apply in real-world engineering challenges. Therefore, many graph layouts are designed for various purposes. It is not easy to choose the most appropriate one. There are a number of surveys on this subject, but they are descriptive ones. In this paper, we focus on the two most versatile—and therefore most widely used—layouts, namely Fruchterman–Reingold and ForceAtlas2, and show their possibilities in a visual way. We compare how the drawings appear while using various settings of the available options. This helps to choose an appropriate set of settings in practice.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Data Visualization and Analytics · Data Management and Algorithms · Graph Theory and Algorithms
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Applied Mathematics, Faculty of Mathematics and Information Technology, Lublin University of Technology, 20-618 Lublin, Poland
References (20)
Show source-provided references
1. Accelerating the Kamada-Kawai Algorithm for Boundary Detection in a Mobile Ad Hoc Network10.1145/3005718 ↗
2. Kenyeres, M., Kenyeres, J., and Hassankhani Dolatabadi, S. (2025). Distributed Consensus Gossip-Based Data Fusion for Suppressing Incorrect Sensor Readings in Wireless Sensor Networks. J. Low Power Electron. Appl., 15.10.3390/jlpea15010006 ↗
3. Zawiślak, S., and Rysińki, J. (2021). Graph-Based Modelling in Science, Technology and Art. Mechanisms and Machine Science, Springer.10.1007/978-3-030-76787-7 ↗
4. Motif-backdoor: Rethinking the backdoor attack on graph neural networks via motifs10.1109/TCSS.2023.3267094 ↗
5. An algorithm for drawing general undirected graphs10.1016/0020-0190(89)90102-6 ↗
6. Graph drawing by force-directed placement10.1002/spe.4380211102 ↗
7. Jacomy, M., Venturini, T., Heymann, S., and Bastian, M. (2014). ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software. PLoS ONE, 9.10.1371/journal.pone.0098679 ↗
8. Martin, S., Brown, W.M., Klavans, R., and Boyack, D.W. (2011, January 24–25). OpenOrd: An open-source toolbox for large graph layout. Proceedings of the Proc. SPIE 7868, Visualization and Data Analysis, San Francisco, CA, USA.10.1117/12.871402 ↗
9. Di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G. (1998). Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall PTR. [1st ed.].
10. A survey of two-dimensional graph layout techniques for information visualisation10.1177/1473871612455749 ↗
11. (2024, September 30). The Open Graph Viz Platform. Available online: https://gephi.org/.
12. The structure of scientific collaboration networks10.1073/pnas.98.2.404 ↗
13. Kerren, A., Garth, C., and Marai, G.E. (2020). The Effect of Graph Layout on the Perception of Graph Properties. EuroVis 2020—Short Papers, The Eurographics Association.
14. Kypridemou, E., Zito, M.A.A., and Bertamini, M. (2022, January 13–17). The effect of graph layout on the perception of graph density: An empirical study. Proceedings of the Eurographics Conference on Visualization, Rome, Italy.
15. The perception of graph properties in graph layouts10.1111/cgf.13410 ↗
16. A heuristic for graph drawing
17. Kobourov, S.G. (2024). Spring Embedders and Force Directed Graph Drawing Algorithms. arXiv.
18. Modularity clustering is force-directed layout10.1103/PhysRevE.79.026102 ↗
19. A hierarchical O(N log N) force-calculation algorithm10.1038/324446a0 ↗
20. Collective dynamics of small-world networks10.1038/30918 ↗