layout.random(graph, params, dim=2)
layout.circle(graph, params)
layout.sphere(graph, params)
layout.fruchterman.reingold(graph, ..., dim=2,
verbose=igraph.par("verbose"), params)
layout.kamada.kawai(graph, ..., dim=2,
verbose=igraph.par("verbose"), params)
layout.spring(graph, ..., params)
layout.reingold.tilford(graph, ..., params)
layout.fruchterman.reingold.grid(graph, ...,
verbose=igraph.par("verbose"), params)
layout.lgl(graph, ..., params)
layout.graphopt(graph, ..., verbose = igraph.par("verbose"), params = list())
layout.mds(graph, d=shortest.paths(graph), ...)
layout.svd(graph, d=shortest.paths(graph), ...)
layout.norm(layout, xmin = NULL, xmax = NULL, ymin = NULL, ymax = NULL,
zmin = NULL, zmax = NULL)
params
argument.NULL
then no normalization is performed along
this direction.NULL
then no normalization is performed along
this direction.NULL
then no normalization is performed along
this direction.layout.drl
layout.random
simply places the vertices randomly on a
square. It has no parameters.
layout.circle
places the vertices on a unit circle
equidistantly. It has no paramaters.
layout.sphere
places the vertices (approximately) uniformly on
the surface of a sphere, this is thus a 3d layout. It is not clear
however what layout.fruchterman.reingold
uses a force-based algorithm
proposed by Fruchterman and Reingold, see references. Parameters and
their default values:
vcount(graph)
).}
vcount(graph)^2
).}
area
*vcount(graph)).}
NULL
. If not
NULL
then the attraction along the edges will be multiplied
by the given edge weights (NULL
).}Kamada, T. and Kawai, S. (1989). An Algorithm for Drawing General Undirected Graphs. Information Processing Letters, 31(1):7-15.
Reingold, E and Tilford, J (1981). Tidier drawing of trees. IEEE Trans. on Softw. Eng., SE-7(2):223--228.
layout.drl
, plot.igraph
, tkplot
g <- graph.ring(10)
layout.random(g)
layout.kamada.kawai(g)
Run the code above in your browser using DataLab