tbl_graph()
when edge to
and from
where encoded as factorsPublished by thomasp85 10 months ago
resolution
argument to group_louvrain()
to mirror the igraph functionas_tbl_graph()
on an edge dataframe now only adds a name node attribute ifnode_is_connected()
to test whether a node is connected to a set ofplay_erdos_renyi()
in favour of play_gnm()
and play_gnp()
slice_*()
functions from dplyr (#128)tidyr::replace_na()
and tidyr::drop_na()
(#114)edge_is_bridge()
for querying whether an edge is a bridge edge (#113)glimpse()
method for tbl_graph
and morphed_tbl_graph
objectsiterate_n()
and iterate_while()
to perform repeated modifications offocus()
/unfocus()
verbs to limit node and edge algorithms to a subsetgraph_automorphisms()
gains a color
argument in line with capabilities ingraph_mean_dist()
now supports edge weights through a new weights
argumentto_largest_component()
morphergraph_is_eulerian()
and edge_rank_eulerian()
for eulerian pathto_random_spanning_tree()
morphermin_order
argument to to_components()
morpherrandom_walk_rank()
to perform random walks on the graphcentrality_harmonic()
+ deprecated centrality_closeness_harmonic()
.group_color()
as an interface to greedy_vertex_coloring()
in igraphgroup_leiden()
to interface with cluster_leiden()
in igraphgroup_fluid()
to interface with cluster_fluid_communities()
in igraphedge_is_feedback_arc()
to interface with feedback_arc_set()
in igraphgraph_efficiency()
and node_effeciency()
interfacing withglobal_efficiency()
and local_efficiency()
in igraphPublished by thomasp85 over 1 year ago
Published by thomasp85 about 2 years ago
Published by thomasp85 over 2 years ago
group_edge_betweenness
, group_fast_greedy
, group_leading_eigen
andgroup_walktrap
have a new argument n_groups
that controls the numbers ofNULL
byPublished by thomasp85 over 4 years ago
nodes
are used for matchingto
and from
columns in edges are character vectors duringbind_graph()
now accepts a list of graphs as its first argument (#88)graph_modularity()
for calculating modularity contingent on a nodeweight
edge attribute. weights = NULL
will always mean that nomap_local()
and siblings will now contain a.central_node
node attribute that will identify the node from which the