networkobjects. Old conversion could mess up edge attributes.
tibble-like dimming of non-data text in printing
to_subcomponentmorpher to work with a single component containing a specified node
node_is_adjacentto query which nodes are directly connected to a set of nodes
tbl_graphobject for plotting as regular data with
tbl_graphfrom an adjacency list containing
convertverb to perform both
crystallisein one go, returning a single
morphthe original data will be stored in
.datato avoid conflicts with
.dataargument in many tidyverse verbs (BREAKING)
as_tbl_graph.data.framenow recognises set tables (each column gives eachs rows membership to that set)
with_graphto allow computation of algorithms outside of verbs
graph_is_*set of querying functions has been added that all returns logical scalars.
%E>%for activating nodes and edges respectively as part of the piping.
mutatenow lets you reference created columns in graph algorithms so it behaves in line with expected
mutatebehaviour. This has led to a slight performance decrease (millisecond scale). The old behaviour can be accessed using
mutate_as_tblwhere the graph will only get updated in the end.
bind_graphsnow work with a single
.register_graph_contextto allow the use of tidygraph algorithms in external functions.
node_rank_*family of algorithms for seriation of nodes
to_hierarchical_clustersmorpher to work with hierarchical representations of community detection algorithms.
group_*algorithms now ensure that the groups are enumerated in descending order based on size, i.e. members of the largest group/community will always have
netrankrresulting in 19 new centrality scores and a manual mode for composing new centrality scores
edge_is_[from|to|between|incident]()to help find edges related to certain nodes