A function to create and manipulate bipartite Cayley colour graphs
ccgraph(x, main=NULL, seed=0, maxiter=100, alpha=c(1, 1, 1), scope, loops,
collRecip, undRecip, showLbs, cex.main, conc, coord, clu, cex, lwd,
pch, lty, bwd, bwd2, att, bg, mar, pos, asp, ecol, vcol, vcol0, lbs,
col, lbat, swp, swp2, scl, mirrorX, mirrorY, mirrorD, mirrorL, mirrorV,
mirrorH, rot, hds, vedist, ffamily, fstyle, fsize, fcol, nr, gens, ...)A plot of the semigroup or group structure.
an algebraic structure, typically a "Semigroup" object class
(optional) title 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
vector (vertex, edge, bg) with the alpha color transparency
(optional) scope of the graph (see details)
(optional, logical, and experimental) plot graph loops?
(optional and logical) whether or not collapse reciprocated edges in the undirected graph
(optional and logical) whether or not plot reciprocated edges as undirected
(optional and logical) whether or not show the vertex labels when dimnames available
(optional) size of the plot's title
(optional and logical) whether the layout is concentric or not
(optional) data frame with the coordinates of the vertices; if coordinates are given then the layout option is ignored
(optional) clustering of the vertices (see details)
(optional) size of the vertices
(optional) width of the edges; ignored if valued is set to TRUE
(optional) symbol representing the vertices
(optional) shape of the edges
(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) width of the bundle loop edges.
(optional) a vector or an array representing the vertex attributes
(optional) background color of the plot
(optional) margins of the plot
(optional) position of the vertices' labels (0 means ``at the center of the vertex'')
(optional) aspect ratio of the plot
(optional) color of the edges
(optional) color of the vertices
(optional) color of the vertices' contour (only works for pch 21 through 25
(optional) vertex labels
(optional) alias for vcol
(optional) labels for the vertex attributes
(optional and logical) whether or not to swap the bundle patterns
(optional and logical) whether or not to swap reciprocals
(optional and experimental) numerical scalar (\(x\) and \(y\)) or vector (\(x\), \(y\)) of the graph's scale
(optional) mirror of the \(X\) axis
(optional) mirror of the \(Y\) axis
(optional) mirror reflection across diagonal \(Y=X\)
(optional) mirror reflection across diagonal \(Y=-X\)
same as mirrorX
same as mirrorY
(optional) clockwise rotation of the graph in degrees
(optional and experimental) arcs' head scale
(optional and experimental) a real number with vertex - edge distance
the font family
the font style
the font size
the font color
for conc layout, number of radii
(optional when absent) semigroup generators in x
Additional argument items (see e.g. par)
Antonio Rivero Ostoic
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.
semigroup, multigraph, frcd, conc
## Create an abstract semigroup from random data
arr <- round( replace( array(runif(18), c(3,3,2)), array(runif(18),
c(3,3,2))>.5, 1 ) )
S <- semigroup(arr)
## plot semigroup's Cayley graph
ccgraph(S)
Run the code above in your browser using DataLab