Struct BipartiteGraph 

pub struct BipartiteGraph {
    pub graph: Graph,
    pub types: Vec<bool>,
}

Result of bipartite_game_gnp / bipartite_game_gnm: the graph together with the boolean type vector that names every vertex as bottom (false) or top (true).

Fields

graph: Graph

Graph on n1 + n2 vertices.

types: Vec<bool>

Per-vertex partition label. types[v] == false for v ∈ 0..n1 (bottom), types[v] == true for v ∈ n1..n1+n2 (top).

Trait Implementations

impl Clone for BipartiteGraph

fn clone(&self) -> BipartiteGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BipartiteGraph

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

Formats the value using the given formatter.