Enum BipartiteMode 

pub enum BipartiteMode {
    Out,
    In,
    All,
}

Edge-direction policy for the directed variants of the bipartite Erdős–Rényi models. See module docs for the mode semantics.

IGRAPH_ALL translates to BipartiteMode::All: each ordered pair (b, t) and (t, b) is sampled independently, so mutual edges between the same b ∈ bottom and t ∈ top can be produced.

Variants

Out

Arcs from bottom to top. Pair space n1·n2.

In

Arcs from top to bottom. Pair space n1·n2.

All

Each ordered direction sampled independently. Pair space 2·n1·n2; mutual pairs are possible.

Trait Implementations

impl Clone for BipartiteMode

fn clone(&self) -> BipartiteMode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BipartiteMode

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

Formats the value using the given formatter.

impl PartialEq for BipartiteMode

fn eq(&self, other: &BipartiteMode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for BipartiteMode

impl Eq for BipartiteMode

impl StructuralPartialEq for BipartiteMode