A layout generator for larger graphs.
layout_with_lgl(graph, maxiter = 150, maxdelta = vcount(graph),
area = vcount(graph)^2, coolexp = 1.5, repulserad = area *
vcount(graph), cellsize = sqrt(sqrt(area)), root = NULL)with_lgl(...)
The input graph
The maximum number of iterations to perform (150).
The maximum change for a vertex during an iteration (the number of vertices).
The area of the surface on which the vertices are placed (square of the number of vertices).
The cooling exponent of the simulated annealing (1.5).
Cancellation radius for the repulsion (the area
times the number of vertices).
The size of the cells for the grid. When calculating the
repulsion forces between vertices only vertices in the same or neighboring
grid cells are taken into account (the fourth root of the number of
area.
The id of the vertex to place at the middle of the layout. The default value is -1 which means that a random vertex is selected.
Passed to layout_with_lgl.
A numeric matrix with two columns and as many rows as vertices.
layout_with_lgl is for large connected graphs, it is similar to the layout
generator of the Large Graph Layout software
(http://lgl.sourceforge.net/).
Other graph layouts: add_layout_;
as_bipartite,
layout.bipartite,
layout_as_bipartite; as_star,
layout.star, layout_as_star;
as_tree, layout_as_tree;
component_wise; in_circle,
layout_in_circle;
layout.auto, layout_nicely,
nicely;
layout.davidson.harel,
layout_with_dh, with_dh;
layout.gem, layout_with_gem,
with_gem; layout.graphopt,
layout_with_graphopt,
with_graphopt; layout.grid,
layout.grid.3d,
layout.grid.3d,
layout_on_grid, on_grid;
layout.mds, layout_with_mds,
with_mds; layout.merge,
layout_components,
merge_coords,
piecewise.layout,
piecewise.layout;
layout.norm, norm_coords;
layout.sugiyama,
layout_with_sugiyama,
with_sugiyama;
layout_on_sphere, on_sphere;
layout_randomly, randomly;
layout_with_fr, with_fr;
layout_with_kk, with_kk;
layout, layout_,
print.igraph_layout_modifier,
print.igraph_layout_spec;
normalize