tidygraph v1.1.2


Monthly downloads



A Tidy API for Graph Manipulation

A graph, while not "tidy" in itself, can be thought of as two tidy data frames describing node and edge data respectively. 'tidygraph' provides an approach to manipulate these two virtual data frames using the API defined in the 'dplyr' package, as well as provides tidy interfaces to a lot of common graph algorithms.



Travis-CI Build Status AppVeyor Build Status CRAN\_Release\_Badge CRAN\_Download\_Badge Coverage Status

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. tidygraph provides a way to switch between the two tables and provides dplyr verbs for manipulating them. Furthermore it provides access to a lot of graph algorithms with return values that facilitate their use in a tidy workflow.

An example


play_erdos_renyi(10, 0.5) %>% 
  activate(nodes) %>% 
  mutate(degree = centrality_degree()) %>% 
  activate(edges) %>% 
  mutate(centrality = centrality_edge_betweenness()) %>% 
#> # A tbl_graph: 10 nodes and 37 edges
#> #
#> # A directed simple graph with 1 component
#> #
#> # Edge Data: 37 x 3 (active)
#>    from    to centrality
#>   <int> <int>      <dbl>
#> 1    10     3   1.500000
#> 2     5     6   1.500000
#> 3     2     7   1.500000
#> 4    10     9   1.500000
#> 5     8     7   1.833333
#> 6     5     8   1.833333
#> # ... with 31 more rows
#> #
#> # Node Data: 10 x 1
#>   degree
#>    <dbl>
#> 1      5
#> 2      3
#> 3      4
#> # ... with 7 more rows


tidygraph is a huge package that exports 280 different functions and methods. It more or less wraps the full functionality of igraph in a tidy API giving you access to almost all of the dplyr verbs plus a few more, developed for use with relational data.

More verbs

tidygraph adds some extra verbs for specific use in network analysis and manipulation. The activate() defines wether one is manipulating node or edge data at the moment as shown in the example above. bind_edges(), bind_nodes(), and bind_graphs() lets 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.

More algorithms

tidygraph wraps almost all of igraphs graph algorithms and provides a consistent interface and output that always matches the sequence of nodes and edges. All tidygraph algorithm 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_degree() and centrality_edge_betweenness() as they are aware of that already. This leads to much clearer code and less typing.

More maps

tidygraph goes beyond dplyr and also implement graph centric version of the purrr map functions. You can now call a function on the nodes in the order of a breath or depth first search while getting access to the result of the previous calls.

More morphs

tidygraph lets 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 morph()/unmorph() verbs hat lets you e.g. contract nodes, work on the linegraph representation, split communities to seperate graphs etc. If you wish to continue with the morphed version, the crystallise() verb lets you freeze the temporary representation into a proper tbl_graph.

More data structure support

While tidygraph is 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 network, phylo, dendrogram, data.tree, graph, etc. More conversion will be added in the order I get aware of them.


tidygraph itself 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.


tidygraph is available on CRAN and can be installed simply, using install.packages(tidygraph). For the development version available on GitHub, use the devtools package for installation:



tidygraph stands on the shoulders of particularly the igraph and dplyr/tidyverse teams. It would not have happened without them, so thanks so much to them.

Functions in tidygraph

Name Description
bind_graphs Add graphs, nodes, or edges to a tbl_graph
pair_measures Calculate node pair properties
fortify.tbl_graph Fortify a tbl_graph for ggplot2 plotting
.register_graph_context Register a graph context for the duration of the current frame
activate Determine the context of subsequent manipulations
as_tbl_graph.data.frame A data structure for tidy graph manipulation
sampling_games Graph games based on direct sampling
map_bfs_back Apply a function to nodes in the reverse order of a breath first search
map_dfs Apply a function to nodes in the order of a depth first search
reroute Change terminal nodes of edges
reexports Objects exported from other packages
tidygraph-package tidygraph: A Tidy API for Graph Manipulation
graph_join Join graphs on common nodes
node_topology Node properties related to the graph topology
graph_measures Graph measurements
mutate_as_tbl Base implementation of mutate
node_measures Querying node measures
type_games Graph games based on different node types
evolution_games Graph games based on evolution
with_graph Evaluate a tidygraph algorithm in the context of a graph
node_rank Calculate node ranking
morph Create a temporary alternative representation of the graph to compute on
node_types Querying node types
edge_types Querying edge types
search_graph Search a graph with depth first and breath first
morphers Functions to generate alternate representations of graphs
graph_types Querying graph types
group_graph Group nodes and edges based on community structure
map_bfs Apply a function to nodes in the order of a breath first search
local_graph Measures based on the neighborhood of each node
map_dfs_back Apply a function to nodes in the reverse order of a depth first search
context_accessors Access graph, nodes, and edges directly inside verbs
map_local Map a function over a graph representing the neighborhood of each node
create_graphs Create different types of well-defined graphs
centrality Calculate node and edge centrality
component_games Graph games based on connected components
No Results!

Last month downloads


Type Package
Date 2019-02-18
License MIT + file LICENSE
Encoding UTF-8
LazyData true
RoxygenNote 6.1.1
URL https://github.com/thomasp85/tidygraph
BugReports https://github.com/thomasp85/tidygraph/issues
LinkingTo Rcpp
NeedsCompilation yes
Packaged 2019-02-18 09:46:42 UTC; thomas
Repository CRAN
Date/Publication 2019-02-18 22:30:03 UTC

Include our badge in your README