Incremental Graphlet Counting for Network Optimisation

An efficient and incremental approach for calculating the differences in orbit counts when performing single edge modifications in a network. Calculating the differences in orbit counts is much more efficient than recalculating all orbit counts from scratch for each time point.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.1 by Robrecht Cannoodt, 4 years ago

Report a bug at

Browse source code at

Authors: Robrecht Cannoodt

Documentation:   PDF Manual  

GPL-3 license

Imports dplyr, methods, Rcpp, orca, purrr, testthat, tibble

Linking to Rcpp, BH

See at CRAN