rcannood/incgraph: 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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | GPL-3 |
| Version | 1.0.2 |
| URL | http://www.github.com/rcannood/incgraph |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
