A layout generator for larger graphs.
Usage
layout_with_lgl(
graph,
...,
maxiter = 150,
maxdelta = NULL,
area = NULL,
coolexp = 1.5,
repulserad = NULL,
cellsize = NULL,
root = NULL
)Arguments
- graph
The input graph
- ...
These dots are for future extensions and must be empty.
- maxiter
The maximum number of iterations to perform (150).
- maxdelta
The maximum change for a vertex during an iteration. The default
NULLuses the number of vertices.- area
The area of the surface on which the vertices are placed. The default
NULLuses the square of the number of vertices.- coolexp
The cooling exponent of the simulated annealing (1.5).
- repulserad
Cancellation radius for the repulsion. The default
NULLuses theareatimes the number of vertices.- cellsize
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 default
NULLuses the square root of the square root of thearea.- root
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.
Details
layout_with_lgl() is for large connected graphs, it is similar to the layout
generator of the Large Graph Layout software
(https://lgl.sourceforge.net/).
See also
with_lgl() to build a lazy layout specification for
add_layout_().
Other graph layouts:
add_layout_(),
component_wise(),
layout_(),
layout_as_bipartite(),
layout_as_star(),
layout_as_tree(),
layout_in_circle(),
layout_nicely(),
layout_on_grid(),
layout_on_sphere(),
layout_randomly(),
layout_with_dh(),
layout_with_fr(),
layout_with_gem(),
layout_with_graphopt(),
layout_with_kk(),
layout_with_mds(),
layout_with_sugiyama(),
merge_coords(),
norm_coords(),
normalize()
Author
Gabor Csardi csardi.gabor@gmail.com
