migraph (version 0.12.1)

partition_layouts: Layout algorithms based on bi- or other partitions

Description

Layout algorithms based on bi- or other partitions

Usage

layout_tbl_graph_hierarchy(object, circular = FALSE, times = 1000)
layout_tbl_graph_alluvial(object, circular = FALSE, times = 1000)
layout_tbl_graph_railway(object, circular = FALSE, times = 1000)
layout_tbl_graph_ladder(object, circular = FALSE, times = 1000)
layout_tbl_graph_concentric(
  object,
  membership = NULL,
  radius = NULL,
  order.by = NULL,
  circular = FALSE,
  times = 1000
)

Arguments

object

An object of a migraph-consistent class:

• matrix (adjacency or incidence) from {base} R

• edgelist, a data frame from {base} R or tibble from {tibble}

• igraph, from the {igraph} package

• network, from the {network} package

• tbl_graph, from the {tidygraph} package

circular

Should the layout be transformed into a radial representation. Only possible for some layouts. Defaults to FALSE

times

Maximum number of iterations, where appropriate

membership

A vector of partition memberships.

radius

A vector of radii at which the concentric circles should be located. By default this is equal placement around an empty centre, unless one (the core) is a single node, in which case this node occupies the centre of the graph.

order.by

An attribute label indicating the (decreasing) order for the nodes around the circles. By default ordering is given by a bipartite placement that reduces the number of edge crossings.

See Also

Other mapping: autographr(), grid_layouts

Examples

(autographr(ison_southern_women, "hierarchy") /
autographr(ison_southern_women, "railway")) |
autographr(ison_southern_women, "concentric")
autographr(ison_karateka, "hierarchy")