Graphics Reference
In-Depth Information
we'll use the madmen2 data set, which has this structure. We'll also use the Fruchterman-Reingold
layout algorithm. The idea is that all the nodes have a magnetic repulsion from one another, but
the edges between nodes act as springs, pulling the nodes together:
Figure 13-8. A directed graph from a data frame, with the Fruchterman-Reingold algorithm
library(gcookbook) # For the data set
madmen2
Name1 Name2
Search WWH ::




Custom Search