Trait gt_directed_bijective_connection_graph::Lemma2

pub trait Lemma2<G> where
    G: Graph, {
    fn lemma2(&self, s: G::Node, d: G::Node) -> GraphPath<G>;
    fn R(&self, s: G::Node, d: G::Node) -> GraphPath<G>;
    fn R_helper(
        &self, 
        n: G::Dims, 
        s: G::Node, 
        d: G::Node, 
        path: &mut GraphPath<G>
    );
}

Required methods

fn lemma2(&self, s: G::Node, d: G::Node) -> GraphPath<G>

fn R(&self, s: G::Node, d: G::Node) -> GraphPath<G>

fn R_helper(&self, n: G::Dims, s: G::Node, d: G::Node, path: &mut GraphPath<G>)

Loading content...

Implementors

impl<G, N, D> Lemma2<G> for G where
    N: Copy + BitAnd<Output = N> + PartialEq + BitXor<Output = N> + InterChangeUsize,
    D: Copy + InterChangeUsize + PartialEq + Sub<Output = D>,
    G: DirectedBijectiveConnectionGraph + Graph<Node = N, Dims = D>, 

fn lemma2(&self, s: G::Node, d: G::Node) -> GraphPath<G>

fn R(&self, s: G::Node, d: G::Node) -> GraphPath<G>

fn R_helper(&self, n: G::Dims, s: G::Node, d: G::Node, path: &mut GraphPath<G>)

Loading content...