Module full_bipartite 

Complete bipartite graph constructor (ALGO-CN-035).

Counterpart of igraph_full_bipartite() in references/igraph/src/misc/bipartite.c:448-528.

A complete bipartite graph K_{n1, n2} has two partitions of sizes n1 and n2 with every possible edge between the two partitions (no edges within a partition).

Vertices [0, n1) form partition 1 and vertices [n1, n1+n2) form partition 2.

Direction is governed by BipartiteMode:

• BipartiteMode::Out — arcs flow from partition 1 to partition 2.
• BipartiteMode::In — arcs flow from partition 2 to partition 1.
• BipartiteMode::All — undirected, or directed with mutual arcs.

Edge counts:

• Undirected / directed Out / directed In: n1 × n2.
• Directed All: 2 × n1 × n2.

Re-exports

pub use crate::algorithms::games::bipartite::BipartiteMode;

Structs

FullBipartite

Bundled return type of full_bipartite.

Functions

full_bipartite

Build the complete bipartite graph K_{n1, n2}.