Modules
The generalized computational scheme for running algorithms
A collection of convenient functions and traits to be used across the crate.
Structs
This structure holds a graph in the Compressed Sparse Row format for compression of data size. This graph is represented via Memory Mapping, allowing the graph to be loaded into memory as required. This makes it possible to load any-size graphs, even those that do not fit into memory!
Iterates over a Graph struct and yields the outgoing edge lists of type &[N] for each node.