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.

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 8 December 2008.
HTML page formatted Tue Dec 6 16:16:32 2011.

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. 8 December 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/graphdrawing.html