graph drawing

(classic problem)

Definition: The problem of representing a graph in a plane "neatly," for instance with a minimum number of edge crossings.

See also grid drawing, orthogonal drawing, straight-line drawing, planar graph, planarization.

Author: PEB

Implementation

draw a graph nicely (C and Mathematica), draw a graph in the plane such that no edges cross (C, C++, and Mathematica), GraphEd: Graph Editor and Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc.

More information

Roberto Tamassia's Graph Drawing links page (conferences, software, etc.)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 19 September 2005.
HTML page formatted Mon Sep 11 09:46:03 2006.

Cite this as:
Paul E. Black, "graph drawing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 19 September 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/graphdrawing.html