Closed mdsumner closed 4 years ago
Yeah, nice! It really doesn't do that much though - just a bunch of fairly standard procedures. I reckon a standard sc_igraph()
function would enable the full functionality on offer there plus a whole lot more. Plus igraph
is C/C++, so must surely be more efficient than python?
I've got a whole bunch of old C++ code for graph generation and simulation lying around from my ecologist days. I should probably one day pull that together into some kind of R package comparable with NetworkX
. From an ecological perspective, the big missing piece is dynamic movement throughout graphs with non-linear interactions at nodes - standard metapop models. That was the abiding aim of most of the code, although only the start of that work ever got published here.
A colleague suggested to make sure we handle the different types, multi, loops, etc. More soon
https://networkx.github.io/documentation/latest/reference/introduction.html#graphs
These types:
The basic graph classes are named: Graph, DiGraph, MultiGraph, and MultiDiGraph
https://networkx.github.io/