Thomas Lin Pedersen announces tidygraph, a tidyverse library for dealing with graphs and trees in R:
One of the simplest concepts when computing graph based values is that of
centrality, i.e. how central is a node or edge in the graph. As this
definition is inherently vague, a lot of different centrality scores exists that
all treat the concept of central a bit different. One of the famous ones is
the pagerank algorithm that was powering Google Search in the beginning.tidygraphcurrently has 11 different centrality measures and all of these are
prefixed withcentrality_*for easy discoverability. All of them returns a
numeric vector matching the nodes (or edges in the case ofcentrality_edge_betweenness()).
This is a big project and is definitely interesting if you’re looking at analyzing graph data.