Rust library for random graph ensembles

Crate Rust unit tests - master

Implements simple sampling and monte carlo (or rather markov-) steps, that can be used to create a markov chain.

This is intended to be used for various different use cases. As such, you can easily define additional data that should be stored at each vertex.

Usage

Add this to your Cargo.toml: ```toml [dependencies] net_ensembles = "0.2"

for feature "serde_support" (enabled by default) also use

serde = { version = "1.0", features = ["derive"] } If you do not need `serde` support, add this instead: toml [dependencies] net_ensembles = { version = "0.2", default-features = false } ```

currently implemented graph ensembles

Graph

Implements measurable quantities

Iterators

For each vertex

methods and more

Iterators

Documentation:

Notes

No warranties whatsoever, but since I am writing this library for my own scientific simulations, I do my best to avoid errors.

You can learn more about me and my research on my homepage.

If you notice any bugs, or want to request new features: do not hesitate to open a new issue on the repository.

vertices

Due to implementation details, where I prioritize fast access of vertices, it is unlikely, that I will implement the option to remove vertices. If I do, it will likely be a relatively costly operation, so keep that in mind.

crates.io

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.