Note: This page has been translated by MathWorks. Click here to see

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

Change layout of graph plot

`layout(H)`

`layout(H,method)`

`layout(H,method,Name,Value)`

`layout(`

changes the layout of graph
plot `H`

)`H`

by using an automatic choice of layout method based on the
structure of the graph. The `layout`

function modifies the
`XData`

and `YData`

properties of
`H`

.

`layout(`

uses additional options specified by one or more Name-Value pair arguments. For
example, `H`

,`method`

,`Name,Value`

)`layout(H,'force','Iterations',N)`

specifies the number of
iterations to use in computing the force layout, and
`layout(H,'layered','Sources',S)`

uses a layered layout with
source nodes `S`

included in the first layer.

Use the

`Layout`

name-value pair to change the layout of a graph when you plot it. For example,`plot(G,'Layout','circle')`

plots the graph`G`

with a circular layout.When using the

`'force'`

or`'force3'`

layout methods, a best practice is to use more iterations with the algorithm instead of using`XStart`

,`YStart`

, and`ZStart`

to restart the algorithm using previous outputs. The result of executing the algorithm with 100 iterations is different in comparison to executing 50 iterations, and then restarting the algorithm from the ending positions to execute 50 more iterations.

[1] Fruchterman, T., and E. Reingold,. “Graph Drawing by
Force-directed Placement.” *Software — Practice &
Experience*. Vol. 21 (11), 1991, pp. 1129–1164.

[2] Gansner, E., E. Koutsofios, S. North, and K.-P Vo. “A
Technique for Drawing Directed Graphs.” *IEEE Transactions on Software
Engineering*. Vol.19, 1993, pp. 214–230.

[3] Barth, W., M. Juenger, and P. Mutzel. “Simple and
Efficient Bilayer Cross Counting.” *Journal of Graph Algorithms and
Applications*. Vol.8 (2), 2004, pp. 179–194.

[4] Brandes, U., and B. Koepf. “Fast and Simple
Horizontal Coordinate Assignment.” *LNCS*. Vol. 2265, 2002,
pp. 31–44.

[5] Y. Koren. “Drawing Graphs by Eigenvectors: Theory and
Practice.” *Computers and Mathematics with Applications*.
Vol. 49, 2005, pp. 1867–1888.