Premium
Graph drawing by force‐directed placement
Author(s) -
Fruchterman Thomas M. J.,
Reingold Edward M.
Publication year - 1991
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380211102
Subject(s) - analogy , undirected graph , heuristic , enhanced data rates for gsm evolution , simple (philosophy) , computer science , theoretical computer science , graph drawing , graph , algorithm , directed graph , mathematics , artificial intelligence , philosophy , epistemology , linguistics
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.