A function to create and manipulate bipartite Cayley colour graphs
ccgraph(x, main = NULL, seed = 0, maxiter = 100, alpha = c(1, 1, 1), scope, collRecip,
showLbs, showAtts, cex.main, coord, clu, cex, lwd, pch, lty, bwd, att, bg, mar,
pos, asp, ecol, vcol, vcol0, hds, vedist, rot, mirrorX, mirrorY, col, lbat, swp,
loops, swp2, scl, mirrorD, mirrorL, conc, lbs, mirrorV, mirrorH,
ffamily, fstyle, fsize, fcol, ...)an algebraic structure, typically a "Semigroup" object class
(optional) title of the plot
(optional) the random seed number for the vertices' initial coordinates. Ignored except for force, stress and rand
(optional) the maximum number of iterations in layout algorithms. Ignored except for force, stress and rand
vector (vertex, edge, bg) with the alpha color transparecy
(optional) the scope of the graph (see details)
(optional and logical) whether or not collapse reciprocated edges in the unidrected graph
(optional and logical) whether or not show the vertex labels when dimnames available
(optional and logical) whether or not show the vertex attribute labels
(optional) the size of the plot's title
(optional) data frame with the coordinates of the vertices. If coordinates are given then the layout option is ignored
(optional) the clustering of the vertices (see details)
(optional) the size of the vertices
(optional) the width of the edges. Ignored if weighted is set to TRUE
(optional) the symbol representing the vertices
(optional) the shape of the edges
(optional) the width of the bundle edges. Ranges from 0 (edges collapsed) to the default 1 (depending on the vertices' size). For weighted a value greater than one is possible
(optional) a vector or an array representing the vertex attributes
(optional) the background color of the plot
(optional) the margins of the plot
(optional) the position of the vertices' labels (0 means ``at the center of the vertex'')
(optional) the aspect ratio of the plot
(optional) the color of the edges
(optional) the color of the vertices
(optional) the color of the vertices' contour (only works for pch 21 through 25
(optional and experimental) arcs' head scale
(optional and experimental) a real number with vertex - edge distance
(optional) clockwise rotation of the graph in degrees
(optional) mirror of the X axis
(optional) mirror of the Y axis
(optional) alias for vcol
(optional) the labels for the vertex attributes
(optional and logical) whether or not swap the bundle patterns
(optional, logical, and experimental) plot graph loops?
(optional and logical) whether or not swap reciprocals
(optional and experimental) numerical scalar (x and y) or vector (x, y) of the graph's scale
(optional) mirror reflection across diagonal Y=X
(optional) mirror reflection across diagonal Y=-X
(optional and logical) whether the layout is concentric or not
(optional) the vertex labels
same as mirrorX
same as mirrorY
the font family
the font style
the font size
the font color
Additional argument items (see e.g. par)
A plot of the semigroup or group structure.
The Cayley colour graph is a graphical representation of the relationships among relations in the relational structure of a given multiplex network. Both nodes and directed edges represent string relations and each shape (and color) corresponds to a specific generator relation of the semigroup structure.
# NOT RUN {
## Create an abstract semigroup
arr <- round( replace( array(runif(18), c(3,3,2)), array(runif(18),
c(3,3,2))>.5, 1 ) )
S <- semigroup(arr)
## plot its Cayley graph
ccgraph(S)
# }
Run the code above in your browser using DataLab