Displays an input graph (and associated vector) as a "target diagram," with vertices restricted to lie at fixed radii from the origin. Such displays are useful ways of representing vertex characteristics and/or local structural properties for graphs of small to medium size.
gplot.target(dat, x, circ.rad = (1:10)/10, circ.col = "blue", circ.lwd = 1, circ.lty = 3, circ.lab = TRUE, circ.lab.cex = 0.75, circ.lab.theta = pi, circ.lab.col = 1, circ.lab.digits = 1, circ.lab.offset = 0.025, periph.outside = FALSE, periph.outside.offset = 1.2, ...)
an input graph.
a vector of vertex properties to be plotted (must match the dimensions of
radii at which to draw reference circles.
reference circle color.
reference circle line width.
reference circle line type.
boolean; should circle labels be displayed?
expansion factor for circle labels.
angle at which to draw circle labels.
color for circle labels.
digits to display for circle labels.
offset for circle labels.
boolean; should "peripheral" vertices be drawn together beyond the normal vertex radius?
radius at which "peripheral" vertices should be drawn if
additional arguments to
A two-column matrix of vertex positions (generated by
gplot.target is a front-end to
gplot which implements the target diagram layout of Brandes et al. (2003). This layout seeks to optimize various aesthetic criteria, given the constraint that all vertices lie at fixed radii from the origin (set by
x). One important feature of this algorithm is that vertices which belong to mutual dyads (described by Brandes et al. as ``core'' vertices) are treated differently from vertices which do not (``peripheral'' vertices). Layout is optimized for core vertices prior to placing peripheral vertices; thus, the result may be misleading if mutuality is not a salient characteristic of the data.
Brandes, U.; Kenis, P.; and Wagner, D. (2003). ``Communicating Centrality in Policy Network Drawings.'' IEEE Transactions on Visualization and Computer Graphics, 9(2):241-253.