A function to create and manipulate bipartite multigraphs
bmgraph(net, layout = c("bip", "bip3", "bip3e", "bipc", "force", "rand", "circ",
"stress", "CA", "circ2"), scope, coord, alpha = c(1, 1, 1), showLbs, showAtts,
att = NULL, lbat = "1", main = NULL, cex.main, bg, mar, directed, valued,
collRecip, cex, pos, lwd, lty, col, ecol, vcol, vcol0, asp, seed = NULL,
maxiter = 100, bwd, clu, pch, rot, mirrorX, mirrorY, mirrorV, mirrorH, hds,
vedist, jitter, sort, add, adc, perm, ffamily, fstyle, fsize, fcol, vclu, ...)A plot of the two-mode network as a bipartite graph or multigraph with a projection
data frame or array representing the two-mode network (see details)
the visualization layout:
bip (default) bipartite graph
bip3 bipartite graph with three columns
bip3e bipartite graph with three columns for events
bipc ``clustered'' bipartite graph
force force-directed algorithm
rand random
circ circular
stress stress-majorization algorithm
CA correspondence analysis
circ2 two semi-circles
(optional) scope of the graph (see details)
(optional) data frame with the coordinates of the vertices; if coordinates are given then the layout option is ignored
vector (vertex, edge, bg) with the alpha color transparency
(optional and logical) whether or not to show the vertex labels when dimnames available
(optional and logical) whether or not to show the vertex attribute labels
(optional) a vector or an array representing the vertex attributes
(optional) labels for the vertex attributes
(optional) title of the plot
(optional) size of the plot's title
(optional) background color of the plot
(optional) margins of the plot
(optional and logical) whether or not the graph is directed or undirected
(optional and logical) whether or not the graph is valued or with dichotomous data
(optional and logical) whether or not collapse reciprocated edges in the undirected graph
(optional) size of the vertices
(optional) position of the vertices' labels (0 means ``at the center of the vertex'')
(optional) width of the edges; ignored if valued is set to TRUE
(optional) shape of the edges
(optional) alias for vcol
(optional) color of the edges
(optional) color of the vertices
(optional) color of the vertices' contour (only works for pch 21 through 25
(optional) aspect ratio of the plot
(optional) random seed number for the vertices' initial coordinates. Ignored except for force, stress and rand
(optional) maximum number of iterations in layout algorithms. Ignored except for force, stress and rand
(optional) width of the bundle edges: ranges from 0 (edges collapsed) to the default 1 (depending on the vertices' size), and
for valued a value greater than one is possible
(optional) clustering of the vertices (see details)
(optional) symbol representing the vertices
(optional) clockwise rotation of the graph in degrees
(optional) mirror of the \(X\) axis
(optional) mirror of the \(Y\) axis
same as mirrorX
same as mirrorY
(optional and experimental) arcs' head scale
(optional and experimental) a real number with vertex - edge distance
(optional) jitter in stress or CA
(optional and logical) sort the vertex labels
(optional) add nodes to the graph's domain
(optional) add nodes to the graph's codomain
(optional) a list of vectors for the permutation of network members in both the domain and codomain
(optional) font family
(optional) font style
(optional) font size
(optional) font color
(optional) clustering information in both the domain and the codomain in a list of vectors with integers or NULL (see details)
Additional argument items (see e.g. par)
Antonio Rivero Ostoic
Bipartite graphs serve as visual aids for two-mode networks. While these networks are typically represented as data frames, they can also be visualized using three-dimensional arrays, where each level corresponds to a specific type of connection, resulting in parallel edges within the bipartite graph. Additionally, a bipartite network can be generated using a force-directed algorithm to create a visual representation.
With bipartite graphs consisting of two sets of vertices, clustering information, such as vertex colors, can be stored in a list vclu with two vectors, one for each vertex set. It is possible to group all members of a vertex set into a single class by setting the corresponding vector to NULL.
multigraph, frcd, stsm, conc
## two binary relations among three elements
arr <- round( replace( array(runif(18), c(3,3,2)), array(runif(18),
c(3,3,2))>.5, 3 ) )
## network as bipartite graph
bmgraph(arr)
## with a force directed algorithm
bmgraph(arr, layout = "force")
## with a Correspondence Analysis method
bmgraph(arr, layout = "CA", asp = NA)
Run the code above in your browser using DataLab