Utopia 2
Framework for studying models of complex & adaptive systems.
|
Functions | |
template<typename Graph > | |
Graph | create_complete_graph (const std::size_t n) |
Create a complete graph. | |
template<typename Graph , typename RNG > | |
Graph | create_ErdosRenyi_graph (const std::size_t num_vertices, const std::size_t mean_degree, bool allow_parallel, bool self_edges, RNG &rng) |
Create a Erdös-Rényi random graph. | |
template<typename Graph > | |
Graph | create_regular_graph (const std::size_t n, const std::size_t k, const bool oriented) |
Create a regular lattice graph. | |
template<typename Graph , typename RNG > | |
Graph | create_KlemmEguiluz_graph (const std::size_t num_vertices, const std::size_t mean_degree, const double mu, RNG &rng) |
Create a Klemm-Eguíluz scale-free small-world highly-clustered graph. | |
template<typename Graph , typename RNG > | |
Graph | BarabasiAlbert_parallel_generator (std::size_t num_vertices, std::size_t mean_degree, RNG &rng) |
Generate a Barabási-Albert scale-free graph with parallel edges. | |
template<typename Graph , typename RNG > | |
Graph | create_BarabasiAlbert_graph (std::size_t num_vertices, std::size_t mean_degree, bool parallel, RNG &rng) |
Create a Barabási-Albert scale-free graph. | |
template<typename Graph , typename RNG > | |
Graph | create_BollobasRiordan_graph (std::size_t num_vertices, double alpha, double beta, double gamma, double del_in, double del_out, RNG &rng) |
Create a scale-free directed graph. | |
template<typename Graph , typename RNG > | |
Graph | create_WattsStrogatz_graph (const std::size_t n, const std::size_t k, const double p_rewire, const bool oriented, RNG &rng) |
Create a Watts-Strogatz small-world graph. | |
template<typename Graph , typename RNG > | |
Graph | create_graph (const Config &cfg, RNG &rng, boost::dynamic_properties pmaps={boost::ignore_other_properties}) |
Create a graph from a configuration node. | |