igraph (version 0.7.1)

layout.bipartite: Simple two-row layout for bipartite graphs

Description

Minimize edge-crossings in a simple two-row (or column) layout for bipartite graphs.

Usage

layout.bipartite (graph, types = NULL, hgap = 1, vgap = 1, maxiter = 100)

Arguments

graph

The bipartite input graph. It should have a logical type vertex attribute, or the types argument must be given.

types

A logical vector, the vertex types. If this argument is NULL (the default), then the type vertex attribute is used.

hgap

Real scalar, the minimum horizontal gap between vertices in the same layer.

vgap

Real scalar, the distance between the two 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.

Value

• A matrix with two columns and as many rows as the number of vertices in the input graph.

concept

• Graph layout
• Bipartite graph
• Two-mode network

Details

The layout is created by first placing the vertices in two rows, according to their types. Then the positions within the rows are optimized to minimize edge crossings, using the Sugiyama algorithm (see layout.sugiyama).

See Also

layout.sugiyama

Examples

# Random bipartite graph
inc <- matrix(sample(0:1, 50, replace=TRUE, prob=c(2,1)), 10, 5)
g <- graph.incidence(inc)
plot(g, layout=layout.bipartite,
     vertex.color=c("green","cyan")[V(g)$type+1])

# Two columns
lay <- layout.bipartite(g)
plot(g, layout=lay[,2:1])