Graph drawing by force‐directed placement
Thomas M. J. Fruchterman, Edward M. Reingold · Software Practice and Experience · 1991
Abstract We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Cited by 6,268 works. doi:10.1002/spe.4380211102
Authors
References
- Optimization by Simulated Annealing
- Graph theory
- GRAPH THEORY
- The AWK Programming Language
- An Efficient Program for Many-Body Simulation
- An algorithm for drawing general undirected graphs
- The Rapid Evaluation of Potential Fields in Particle Systems
- Algorithms for drawing graphs: an annotated bibliography
- A Heuristic for Graph Drawing
- The C programming language