Struct BinomialGraphDistribution

pub struct BinomialGraphDistribution { /* private fields */ }

Implementations

impl BinomialGraphDistribution

pub fn new(nodes: usize, p: f64) -> Result<Self, BinomialGraphError>

Creates a new BinomialGraphDistribution with nodes nodes, and where up to binomial(nodes, 2) edges are inserted independently with probability p.

Will return an error if p < 0 or p > 1.

Example

use random_graphs::prelude::*;
use rand::prelude::*;

let distribution = BinomialGraphDistribution::new(4, 0.25).unwrap();

// Generate a random graph
let graph = distribution.sample(&mut thread_rng());
assert_eq!(graph.node_count(), 4);

Trait Implementations

impl Clone for BinomialGraphDistribution

fn clone(&self) -> BinomialGraphDistribution

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BinomialGraphDistribution

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Distribution<Graph<usize, (), Undirected>> for BinomialGraphDistribution

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> Graph<usize, (), Undirected>

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.