Struct HyperCube

pub struct HyperCube(/* private fields */);

Implementations

impl HyperCube

pub fn new(n: Dims) -> Self

Examples found in repository

examples/hyper_cube_examples.rs (line 21)

fn example_lemma1() {
    println!("this is an example of lemma1 on a HyperCube.");
    let n = 8;
    let s = 0b0000_0001;

    let graph = HyperCube::new(n);

    let path = graph.n_paths_to_node(n, s);

    println!("{:#?}", path);
}

fn example_lemma2() {
    println!("this is an example of lemma2 on a HyperCube");
    let n = 8;
    let s = 0b0011_0011;
    let d = 0b1010_1010;

    let graph = HyperCube::new(n);

    let path = graph.single_path(s, d);

    println!("{:?}", path);
}

fn example_node_to_set() {
    println!("This is an example of node to set on a HyperCube");
    let n = 8;
    let s = 0b0101_0101;
    let mut d = vec![];

    for i in 0..8 {
        d.push(1 << i);
    }

    let graph = HyperCube::new(n);

    let paths = graph.node_to_set_disjoint_paths(s, &d);

    println!("{:#?}", paths);
}

fn example_node_to_node() {
    println!("This is an example of node to node on a HyperCube");
    let n = 8;
    let s = 0b0101_0101;
    let d = 0b0000_1111;

    let graph = HyperCube::new(n);

    let paths = graph.node_to_node_disjoint_paths(s, d);

    println!("{:#?}", paths);
}

Trait Implementations

impl DirectedBijectiveConnectionGraph for HyperCube

fn psi(&self, n: u64, node: u64) -> u64

impl Graph for HyperCube

fn dimension(&self) -> u64

fn phi(&self, n: Dims, node: Node) -> Node