make_named_ego_graph: Get ego-networks for a graph as a named list

In alan-turing-institute/network-comparison: An implementation of the NetEMD alignment-free network distance measure

Get ego-networks for a graph as a named list

Description

Simple wrapper for the igraph::make_ego_graph function that names each ego-network in the returned list with the name of the node in the original graph that the ego-network was generated from

Usage

make_named_ego_graph(graph, order, min_ego_nodes = 3, min_ego_edges = 1, ...)

Arguments

graph	An igraph object
order	The number of steps from the source node to include nodes for each ego-network.
min_ego_nodes	Only ego networks with at least min_ego_nodes nodes are returned.
min_ego_edges	Only ego networks with at least min_ego_edges edges are returned.
...	Additional parameters to be passed to the underlying igraph::make_ego_graph function used.

alan-turing-institute/network-comparison documentation built on June 7, 2022, 10:41 p.m.