layout.merge: Merging graph layouts

Description

Place several graphs on the same layout

Usage

layout.merge(graphs, layouts, method = "dla",
       verbose = igraph.par("verbose"))

Arguments

graphs

A list of graph objects.

layouts

A list of two-column matrices.

method

Character constant giving the method to use. Right now only dla is implemented.

verbose

Logical constant, whether to show a progress bar while doing the calculation.

Value

A matrix with two columns and as many lines as the total number of vertices in the graphs.

Details

This function takes a list of graphs and a list of coordinates and places the graphs in a common layout. The method to use is chosen via the method parameter, although right now only the dla method is implemented.

The dla method covers the graph with circles. Then it sorts the graphs based on the number of vertices first and places the largest graph at the center of the layout. Then the other graphs are placed in decreasing order via a DLA (diffision limited aggregation) algorithm: the graph is placed randomly on a circle far away from the center and a random walk is conducted until the graph walks into the larger graphs already placed or walks too far from the center of the layout.

Examples

Run this code

# create 20 scale-free graphs and place them in a common layout
graphs <- lapply(sample(5:20, 20, replace=TRUE),
          barabasi.game, directed=FALSE)
layouts <- lapply(graphs, layout.kamada.kawai)
lay <- layout.merge(graphs, layouts)
g <- graph.disjoint.union(graphs)
plot(g, layout=lay, vertex.size=3, labels=NA, edge.color="black")

Run the code above in your browser using DataLab

Last chance! 50% off unlimited learning