Function erdos_renyi_gnm 

pub fn erdos_renyi_gnm(
    n: u32,
    m: u64,
    directed: bool,
    loops: bool,
    seed: u64,
) -> IgraphResult<Graph>

Generate a random graph from the G(n, m) Erdős–Rényi model.

Exactly m edges are drawn uniformly at random from the max_edges(n, directed, loops) possible edges. Sampling is without replacement (simple graph).

• n — vertex count.
• m — edge count.
• directed, loops, seed — see erdos_renyi_gnp.

Errors

Returns IgraphError::InvalidArgument if m exceeds max_edges(n, directed, loops).

Examples

use rust_igraph::erdos_renyi_gnm;
let g = erdos_renyi_gnm(20, 30, false, false, 7).unwrap();
assert_eq!(g.vcount(), 20);
assert_eq!(g.ecount(), 30);