geometric-traits 0.1.0

Trait-based algebraic and graph algorithms for Rust, supporting no_std environments
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

//! Generator for complete bipartite graphs (K_{m,n}).
#![cfg(feature = "alloc")]

use alloc::vec::Vec;

use super::builder_utils::build_symmetric;
use crate::impls::{CSR2D, SymmetricCSR2D};

/// Returns the complete bipartite graph K_{m,n}.
///
/// Left vertices 0..m, right vertices m..m+n.
#[must_use]
pub fn complete_bipartite_graph(m: usize, n: usize) -> SymmetricCSR2D<CSR2D<usize, usize, usize>> {
    let total = m + n;
    let mut edges = Vec::with_capacity(m * n);
    for i in 0..m {
        for j in 0..n {
            edges.push((i, m + j));
        }
    }
    build_symmetric(total, edges)
}