Editing Graph drawing (section)

==Application-specific graph drawings==
Graphs and graph drawings arising in other areas of application include
* [[Sociogram]]s, drawings of a [[social network]], as often offered by [[social network analysis software]]<ref>{{Harvard citation text|Scott|2000}}; {{Harvard citation text|Brandes|Freeman|Wagner|2014}}.</ref>
* [[Hasse diagram]]s, a type of graph drawing specialized to [[partial order]]s<ref>{{Harvard citation text|Di Battista|Eades|Tamassia|Tollis|1998}}, pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; {{Harvard citation text|Freese|2004}}.</ref>
* [[Dessin d'enfant]]s, a type of graph drawing used in [[algebraic geometry]]{{sfnp|Zapponi|2003}}
* [[State diagram]]s, graphical representations of [[finite-state machine]]s{{sfnp|Anderson|Head|2006}}
* [[Computer network diagram]]s, depictions of the nodes and connections in a [[computer network]]{{sfnp|Di Battista|Rimondini|2014}}
* [[Flowchart]]s and [[DRAKON|drakon-charts]], drawings in which the nodes represent the steps of an [[algorithm]] and the edges represent [[control flow]] between steps.
* [[Project network]], graphical depiction of the chronological order in which activities of a [[Project management|project]] are to be completed.
* [[Data-flow diagram]]s, drawings in which the nodes represent the components of an [[information system]] and the edges represent the movement of information from one component to another.
* [[Bioinformatics]] including [[phylogenetic tree]]s, [[protein–protein interaction]] networks, and [[metabolic pathway]]s.{{sfnp|Bachmaier|Brandes|Schreiber|2014}}

In addition, the [[placement (electronic design automation)|placement]] and [[Routing (electronic design automation)|routing]] steps of [[electronic design automation]] (EDA) are similar in many ways to graph drawing, as is the problem of [[greedy embedding]] in [[distributed computing]], and the graph drawing literature includes several results borrowed from the EDA literature. However, these problems also differ in several important ways: for instance, in EDA, area minimization and signal length are more important than aesthetics, and the routing problem in EDA may have more than two terminals per net while the analogous problem in graph drawing generally only involves pairs of vertices for each edge.