# 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 Black.

Entry modified 2 September 2014.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Paul E. Black, "graph drawing", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/graphdrawing.html