Graph drawing by force‐directed placement

4.6kCitations
Citations of this article
1.9kReaders
Mendeley users who have this article in their library.
Get full text

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. Copyright © 1991 John Wiley & Sons, Ltd

References Powered by Scopus

Optimization by simulated annealing

34748Citations
N/AReaders
Get full text

An algorithm for drawing general undirected graphs

2030Citations
N/AReaders
Get full text

A Forced Directed Component Placement Procedure for Printed Circuit Boards

184Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Software survey: VOSviewer, a computer program for bibliometric mapping

12168Citations
N/AReaders
Get full text

SCANPY: Large-scale single-cell gene expression data analysis

3680Citations
N/AReaders
Get full text

Qgraph: Network visualizations of relationships in psychometric data

2856Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Fruchterman, T. M. J., & Reingold, E. M. (1991). Graph drawing by force‐directed placement. Software: Practice and Experience, 21(11), 1129–1164. https://doi.org/10.1002/spe.4380211102

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 918

64%

Researcher 328

23%

Professor / Associate Prof. 160

11%

Lecturer / Post doc 25

2%

Readers' Discipline

Tooltip

Computer Science 545

55%

Agricultural and Biological Sciences 175

18%

Psychology 133

14%

Social Sciences 129

13%

Article Metrics

Tooltip
Mentions
Blog Mentions: 2
News Mentions: 8
References: 7

Save time finding and organizing research with Mendeley

Sign up for free