NEWS.md
group_edge_betweenness, group_fast_greedy, group_leading_eigen and group_walktrap have a new argument n_groups that controls the numbers of groups computed. The argument expects an integer value and it is NULL by default.nodes are used for matching if the to and from columns in edges are character vectors during construction (#89)bind_graph() now accepts a list of graphs as its first argument (#88)graph_modularity() for calculating modularity contingent on a node grouping (#97)weight edge attribute. weights = NULL will always mean that no edge weight is used (#106).map_local() and siblings will now contain a .central_node node attribute that will identify the node from which the local graph has been calculated (#107)network objects. Old conversion could mess up edge attributes.tibble and dplyr
tibble-like dimming of non-data text in printingphylo
to_subcomponent morpher to work with a single component containing a specified nodenode_is_adjacent to query which nodes are directly connected to a set of nodesfortify method for tbl_graph object for plotting as regular data with ggplot2
tbl_graph from an adjacency list containing NULL or NA elements.convert verb to perform both morph and crystallise in one go, returning a single tbl_graph
morph the original data will be stored in .orig_data instead of .data to avoid conflicts with .data argument in many tidyverse verbs (BREAKING)as_tbl_graph.data.frame now recognises set tables (each column gives eachs rows membership to that set)with_graph to allow computation of algorithms outside of verbsgraph_is_* set of querying functions has been added that all returns logical scalars.%N>% and %E>% for activating nodes and edges respectively as part of the piping.mutate now lets you reference created columns in graph algorithms so it behaves in line with expected mutate behaviour. This has led to a slight performance decrease (millisecond scale). The old behaviour can be accessed using mutate_as_tbl where the graph will only get updated in the end.bind_graphs now work with a single tbl_graph
.register_graph_context to allow the use of tidygraph algorithms in external functions.to_unfolded_tree, to_directed, and to_undirected morphersnode_rank_* family of algorithms for seriation of nodesto_hierarchical_clusters morpher 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 1, etc.netrankr resulting in 19 new centrality scores and a manual mode for composing new centrality scoresedge_is_[from|to|between|incident]() to help find edges related to certain nodes