layout_with_kk(graph, coords = NULL, dim = 2, maxiter = 50 *
vcount(graph), epsilon = 0, kkconst = vcount(graph), weights = NULL,
minx = NULL, maxx = NULL, miny = NULL, maxy = NULL, minz = NULL,
maxz = NULL, niter, sigma, initemp, coolexp, start)with_kk(...)
NULL
, then the starting coordinates should be
given here, in a two or three column matrix, depending on the dim
argument.epsilon
argument.maxiter
iterations.NULL
, then it must be a numeric vector that gives
lower boundaries for the minx
, but gives the upper boundaries.minx
, but gives the lower boundaries of the
minx
, but gives the upper boundaries of the
minx
, but gives the lower boundaries of the
minx
, but gives the upper boundaries of the
coords
, for compatibility.layout_with_kk
.This function was rewritten from scratch in igraph version 0.8.0 and it follows truthfully the original publication by Kamada and Kawai now.
layout_with_drl
, plot.igraph
,
tkplot
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_lgl
, with_lgl
;
layout
, layout_
,
print.igraph_layout_modifier
,
print.igraph_layout_spec
;
normalize
g <- make_ring(10)
E(g)$weight <- rep(1:2, length.out=ecount(g))
plot(g, layout=layout_with_kk, edge.label=E(g)$weight)
Run the code above in your browser using DataCamp Workspace