Trait BinaryLayout 

pub trait BinaryLayout: RawLayout {
    // Required methods
    fn lhs(&self) -> &VertexId<Self::Index>;
    fn rhs(&self) -> &VertexId<Self::Index>;
}

A BinaryLayout represents a specific type of edge that essentially defines the standard edge layout of a normal graph, where each edge connects exactly two vertices.

Required Methods

fn lhs(&self) -> &VertexId<Self::Index>

fn rhs(&self) -> &VertexId<Self::Index>

Implementors

impl<E, S, I, K> BinaryLayout for Edge<E, S, K, I>

where E: BinaryLayout, S: BinaryDomain<I>, I: RawIndex, K: GraphType,

impl<S, I, K> BinaryLayout for Link<S, K, I>

where S: BinaryDomain<I>, I: RawIndex, K: GraphType,