For quick and easy graphing of networks to a grid plot
Usage
ggraphgrid(x, algorithm = c("kk", "fr"))
Arguments
x
A migraph-consistent network/graph
algorithm
An initial network layout,
currently either Kamada-Kawai ("kk") or
Fruchterman-Reingold ("fr")
Details
The function uses approximate pattern matching
to redistributes the coarse layouts on the square grid points, while
preserving the topological relationships among the nodes (see Inoue et al. 2012).
References
Inoue et al. (2012).
Application of Approximate Pattern Matching in Two Dimensional
Spaces to Grid Layout for Biochemical Network Maps.
PLoS One 7 (6): e37739. doi: https://doi.org/10.1371/journal.pone.0037739.