netUtils0.8.4 package

A Collection of Tools for Network Analysis

sample_lfr

LFR benchmark graphs

core_periphery

Discrete core-periphery model

dyad_census_attr

dyad census with node attributes

fast_cliques

Find Cliques, maximal or not, fast

graph_cartesian

Cartesian product of two graphs

graph_cor

Graph correlation

graph_direct

Direct product of two graphs

graph_from_multi_edgelist

Multiple networks from a single edgelist with a typed attribute

graph_kpartite

k partite graphs

helpers

helper function

reciprocity_cor

Reciprocity correlation coefficient

sample_coreseq

Generate random graphs with a given coreness sequence

as_adj_list1

Adjacency list

as_adj_weighted

weighted dense adjacency matrix

as_multi_adj

Convert a list of graphs to an adjacency matrices

bipartite_from_data_frame

two-mode network from a data.frame

clique_vertex_mat

Clique Vertex Matrix

sample_pa_homophilic

Homophilic random graph using BA preferential attachment model

split_graph

split graph

str.igraph

Print graphs to terminal

structural_equivalence

Maximal Structural Equivalence

triad_census_attr

triad census with node attributes

Download source packageRead PDF manual

Provides a collection of network analytic (convenience) functions which are missing in other standard packages. This includes triad census with attributes <doi:10.1016/j.socnet.2019.04.003>, core-periphery models <doi:10.1016/S0378-8733(99)00019-2>, and several graph generators. Most functions are build upon 'igraph'.

  • Maintainer: David Schoch
  • License: MIT + file LICENSE
  • Last published: 2026-01-24

Useful links