layout.sugiyama: The Sugiyama graph layout generator
In igraph/rigraph: Network Analysis and Visualization

layout.sugiyama

R Documentation

The Sugiyama graph layout generator

layout.sugiyama() was renamed to layout_with_sugiyama() to create a more consistent API.

layout.sugiyama(
  graph,
  layers = NULL,
  hgap = 1,
  vgap = 1,
  maxiter = 100,
  weights = NULL,
  attributes = c("default", "all", "none")
)

`graph`	The input graph.
`layers`	A numeric vector or `NULL`. If not `NULL`, then it should specify the layer index of the vertices. Layers are numbered from one. If `NULL`, then igraph calculates the layers automatically.
`hgap`	Real scalar, the minimum horizontal gap between vertices in the same layer.
`vgap`	Real scalar, the distance between layers.
`maxiter`	Integer scalar, the maximum number of iterations in the crossing minimization stage. 100 is a reasonable default; if you feel that you have too many edge crossings, increase this.
`weights`	Optional edge weight vector. If `NULL`, then the 'weight' edge attribute is used, if there is one. Supply `NA` here and igraph ignores the edge weights. These are used only if the graph contains cycles; igraph will tend to reverse edges with smaller weights when breaking the cycles.
`attributes`	Which graph/vertex/edge attributes to keep in the extended graph. ‘default’ keeps the ‘size’, ‘size2’, ‘shape’, ‘label’ and ‘color’ vertex attributes and the ‘arrow.mode’ and ‘arrow.size’ edge attributes. ‘all’ keep all graph, vertex and edge attributes, ‘none’ keeps none of them.