A tidy API for graph manipulation
This package provides a tidy API for graph/network manipulation. While network data itself is not tidy, it can be envisioned as two tidy tables, one for node data and one for edge data.
tidygraphprovides a way to switch between the two tables and provides
dplyrverbs for manipulating them. Furthermore it provides access to a lot of graph algorithms with return values that facilitate their use in a tidy workflow.
play_erdos_renyi(10, 0.5) %>% activate(nodes) %>% mutate(degree = centrality_degree()) %>% activate(edges) %>% mutate(centrality = centrality_edge_betweenness()) %>% arrange(centrality) #> # A tbl_graph: 10 nodes and 46 edges #> # #> # A directed simple graph with 1 component #> # #> # Edge Data: 46 x 3 (active) #> from to centrality #> * #> 1 1 8 1.33 #> 2 5 8 1.42 #> 3 5 3 1.75 #> 4 3 7 1.75 #> 5 5 7 1.92 #> 6 5 1 2.00 #> # … with 40 more rows #> # #> # Node Data: 10 x 1 #> degree #> #> 1 5 #> 2 6 #> 3 4 #> # … with 7 more rows
tidygraphis a huge package that exports 280 different functions and methods. It more or less wraps the full functionality of
igraphin a tidy API giving you access to almost all of the
dplyrverbs plus a few more, developed for use with relational data.
tidygraphadds some extra verbs for specific use in network analysis and manipulation. The
activate()function defines whether one is manipulating node or edge data at the moment as shown in the example above.
bind_graphs()let you expand the graph structure you’re working with, while
graph_join()lets you merge two graphs on some node identifier.
reroute(), on the other hand, lets you change the terminal nodes of the edges in the graph.
tidygraphwraps almost all of the graph algorithms from
igraphand provides a consistent interface and output that always matches the sequence of nodes and edges. All
tidygraphalgorithm wrappers are intended for use inside verbs where they know the context they are being called in. In the example above it is not necessary to supply the graph nor the node/edge IDs to
centrality_edge_betweenness()as they are aware of them already. This leads to much clearer code and less typing.
dplyrand also implements graph centric version of the
purrrmap functions. You can now call a function on the nodes in the order of a breadth or depth first search while getting access to the result of the previous calls.
tidygraphlets you temporarily change the representation of your graph, do some manipulation of the node and edge data, and then change back to the original graph with the changes being merged in automatically. This is powered by the new
unmorph()verbs that let you e.g. contract nodes, work on the linegraph representation, split communities to separate graphs etc. If you wish to continue with the morphed version, the
crystallise()verb lets you freeze the temporary representation into a proper
tidygraphis powered by igraph underneath it wants everyone to join the fun. The
as_tbl_graph()function can easily convert relational data from all your favourite objects, such as
graph, etc. More conversion will be added in the order I become aware of them.
tidygraphitself does not provide any means of visualisation, but it works flawlessly with
ggraph. This division makes it easy to develop the visualisation and manipulation code at different speeds depending on where the needs arise.
tidygraphis available on CRAN and can be installed simply, using
install.packages('tidygraph'). For the development version available on GitHub, use the
devtoolspackage for installation:
# install.packages('devtools') devtools::install_github('thomasp85/tidygraph')
tidygraphstands on the shoulders of particularly the
tidyverseteams. It would not have happened without them, so thanks so much to them.
Please note that the ‘tidygraph’ project is released with a Contributor Code of Conduct. By contributing to this project, you agree to abide by its terms.