Graph drawing by force‐directed placement
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In pathological settings, especially cancer97,130,131, such hybrid states may reflect either transitions (below) or the intrinsic abnormal mixture of different functional modules (N.Y., A.R. and colleagues130).”
From Revealing the vectors of cellular identity with single-cell genomics (2016) · cites this paper as [130]
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Harary, F. (1969) · Cited by 10,739
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Stroustrup, B. (1985) · Cited by 4,409
An algorithm for drawing general undirected graphs
Kamada, T., & Kawai, S. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90102-6 · Cited by 2,698
Eades, P. (1984) · Congressus Numerantium · Cited by 1,147
The Rapid Evaluation of Potential Fields in Particle Systems
Greengard, L. F. (1988) · The MIT Press eBooks · doi:10.7551/mitpress/5750.001.0001 · Cited by 1,066
Combinatorial Algorithms: Theory and Practice
Reingold, E. M., Nievergelt, J., & Deo, N. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 905
Self-citationAlgorithms for drawing graphs: an annotated bibliography
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1994) · Computational Geometry · doi:10.1016/0925-7721(94)00014-x · Cited by 854
Jones, R. (1985) · Data Processing · doi:10.1016/0011-684x(85)90032-2 · Cited by 557
Research works printed but not linked: 5
- Tipler P. A., 1982, Physics
- Kamada T., 1988, Technical Report 88–007
- Hearn D., 1986, Computer Graphics
- Breuer M. A., 1977, Min‐cut placement, Journal of Design Automation and Fault Tolerant Computing, 1, 343
- Dewhurst S. C., 1989, Programming in C++
Cited by
Items 1,001–1,021 of 1,021
Combining hierarchy and energy for drawing directed graphs
Carmel, L., Harel, D., & Koren, Y. (2004) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2004.1260757 · Cited by 34
Ren, L., Yang, Z., Wang, Y., Cui, L.-B., Jin, Y., Ma, Z., Zhang, Q., Wu, Z., Wang, H.-N., & Yang, Q. (2020) · BMC Psychiatry · doi:10.1186/s12888-020-02849-w · Cited by 33
“This algorithm locates the nodes with stronger correlations near the center of the network, with the nodes with weaker correlations being located near the periphery of the network [77].”
Introducing a science interest network model to reveal country differences.
Sachisthal, M. S. M., Jansen, B. R. J., Peetsma, T. T. D., Dalege, J., van der Maas, H. L. J., & Raijmakers, M. E. J. (2019) · Journal of Educational Psychology · doi:10.1037/edu0000327 · Cited by 32
“…the figures, closely connected nodes were placed near each other and nodes with weaker connections were placed closer to the periphery of the network, whereas nodes with stronger connections were placed in the center of the network, which matches the layout used by Fruchterman and Reingold (1991).”
MethodParanoia in patients attending child and adolescent mental health services
Bird, J. C., Fergusson, E. C., Kirkham, M., Shearn, C., Teale, A.-L., Carr, L., Stratford, H. J., James, A. C., Waite, F., & Freeman, D. (2021) · Australian & New Zealand Journal of Psychiatry · doi:10.1177/0004867420981416 · Cited by 32
MSMExplorer: visualizing Markov state models for biomolecule folding simulations
Cronkite-Ratcliff, B., & Pande, V. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt051 · Cited by 25
“…atics.oxfordjournals.org/ D ow nloaded from B. Cronkite-Ratcliff and V. Pande 2 Automatic Graph Drawing: MSMExplorer makes use of a ForceDirected Layout algorithm for automatic graph drawing, wherein edges act as springs and nodes as masses (Eades, 1984; Fruchterman & Reingold, 1991).”
MethodHoffart, A., Burger, J., Johnson, S. U., & Ebrahimi, O. V. (2023) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2022.102658 · Cited by 21
Multiple paths to rumination within a network analytical framework
Tamm, G., Koster, E. H. W., & Hoorelbeke, K. (2024) · Scientific Reports · doi:10.1038/s41598-024-61469-6 · Cited by 22
“The Fruchterman-Reingold algorithm 83 was used, which aims to position more influential nodes in the center of the model.”
A network model of activities in primary care consultations
Kocaballi, A. B., Coiera, E., Tong, H. L., White, S. J., Quiroz, J. C., Rezazadegan, F., Willcock, S., & Laranjo, L. (2019) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocz046 · Cited by 23
Zhang, M., Tang, E., Ding, H., & Zhang, Y. (2024) · Journal of Speech, Language, and Hearing Research · doi:10.1044/2024_jslhr-24-00157 · Cited by 22
Yang, T., He, Y., Wu, L., Ren, L., Lin, J., Wang, C., Wu, S., & Liu, X. (2023) · Heliyon · doi:10.1016/j.heliyon.2023.e20938 · Cited by 21
Schäffer, D. E., Iyer, L. M., Burroughs, A. M., & Aravind, L. (2020) · Frontiers in Genetics · doi:10.3389/fgene.2020.00034 · Cited by 20
A network analysis of two conceptual approaches to the etiology of PTSD
Benfer, N., Bardeen, J. R., Spitzer, E. G., & Rogers, T. A. (2021) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2021.102479 · Cited by 16
East, A., Dawson, D. E., Brady, S., Vallero, D. A., & Tornero-Velez, R. (2023) · Toxics · doi:10.3390/toxics11020163 · Cited by 14
“To analyze the bibliometric relationships between the authors of the included studies, the R Package Bibliometrix [38,39] and the corresponding RShiny application Biblioshiny [38] were used.”
MethodInfluentialHierarchical cortical transcriptome disorganization in autism
Lombardo, M. V., Courchesne, E., Lewis, N. E., & Pramparo, T. (2016) · doi:10.1101/042937 · Cited by 7
Network modeling of problematic social media use components in college student social media users
Chen, J., Su, T., Dong, J., Li, Y., Feng, J., Chen, Y., & Liu, G. (2025) · Frontiers in Psychiatry · doi:10.3389/fpsyt.2024.1386845 · Cited by 7
Masson, H., Tat, J., Di Giusto, P., Antonakoudis, A., Shamie, I., Baghdassarian, H., Samoudi, M., Robinson, C. M., Kuo, C.-C., Koga, N., et al. (2025) · Cell Systems · doi:10.1016/j.cels.2025.101453 · Cited by 6
Comparing symptom networks of daytime and nocturnal panic attacks in a community-based sample
Smith, N. S., Bauer, B. W., & Capron, D. W. (2022) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2021.102514 · Cited by 4
Pathways to experienced coercion during psychiatric admission: a network analysis
Silva, B., Morandi, S., Bachelard, M., Bonsack, C., & Golay, P. (2024) · BMC Psychiatry · doi:10.1186/s12888-024-05968-w · Cited by 4
Artificial Intelligence Chatbots Mimic Human Collective Behaviour
He, J., Wallis, F., Gvirtz, A., & Rathje, S. (2024) · doi:10.21203/rs.3.rs-3096289/v2 · Cited by 4
Anastassacos, N., Hailes, S., & Musolesi, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i05.6190 · Cited by 4
Azad, A., Kovanovic, V., Korolkiewicz, M., Zamecnik, A., Joksimovic, S., & Cukurova, M. (2026) · Learning and Instruction · doi:10.1016/j.learninstruc.2025.102268 · Cited by 1
Metadata
- Authors
- Fruchterman, T. M. J., & Reingold, E. M.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 1991-11
- Volume
- 21
- Issue
- 11
- Pages
- 1129-1164
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W2167482691
- Cited by
- 6,352
- References
- 19
- Citations by year
- 2026: 283 · 2025: 430 · 2024: 451 · 2023: 474 · 2022: 425 · 2021: 442 · 2020: 456 · 2019: 331 · 2018: 313 · 2017: 290 · 2016: 284 · 2015: 275 · 2014: 246 · 2013: 238 · 2012: 225
- FWCI
- 5.14
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Software Practice and Experience (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- network visualization, force-directed placement, undirected graphs, graph layout algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.