Trait VDblGraph

pub trait VDblGraph {
    type V: Eq + Clone;
    type E: Eq + Clone;
    type ProE: Eq + Clone;
    type Sq: Eq + Clone;

    // Required methods
    fn has_vertex(&self, v: &Self::V) -> bool;
    fn has_edge(&self, e: &Self::E) -> bool;
    fn has_proedge(&self, p: &Self::ProE) -> bool;
    fn has_square(&self, sq: &Self::Sq) -> bool;
    fn dom(&self, e: &Self::E) -> Self::V;
    fn cod(&self, e: &Self::E) -> Self::V;
    fn src(&self, p: &Self::ProE) -> Self::V;
    fn tgt(&self, p: &Self::ProE) -> Self::V;
    fn square_dom(&self, sq: &Self::Sq) -> Path<Self::V, Self::ProE>;
    fn square_cod(&self, sq: &Self::Sq) -> Self::ProE;
    fn square_src(&self, sq: &Self::Sq) -> Self::E;
    fn square_tgt(&self, sq: &Self::Sq) -> Self::E;

    // Provided method
    fn arity(&self, sq: &Self::Sq) -> usize { ... }
}

A virtual double graph, the data underlying a virtual double category.

Following our nomenclature for double categories, we say that an edge in a double graph has a domain and codomain, whereas a proedge has a source and a target. A square has all four of those.

Required Associated Types

type V: Eq + Clone

Type of vertices.

type E: Eq + Clone

Type of edges, in tight direction.

type ProE: Eq + Clone

Type of “pro-edges”, or edges in the loose direction.

type Sq: Eq + Clone

Type of squares with multi-ary domain.

Required Methods

fn has_vertex(&self, v: &Self::V) -> bool

Does the vertex belong to the double graph?

fn has_edge(&self, e: &Self::E) -> bool

Does the edge belong to the double graph?

fn has_proedge(&self, p: &Self::ProE) -> bool

Does the proedge belong to the double graph?

fn has_square(&self, sq: &Self::Sq) -> bool

Does the square belong to the double graph?

fn dom(&self, e: &Self::E) -> Self::V

Gets the domain of an edge.

fn cod(&self, e: &Self::E) -> Self::V

Gets the codomain of an edge.

fn src(&self, p: &Self::ProE) -> Self::V

Gets the source of a proedge.

fn tgt(&self, p: &Self::ProE) -> Self::V

Gets the target of a proedge.

fn square_dom(&self, sq: &Self::Sq) -> Path<Self::V, Self::ProE>

Gets the domain of a square, a path of proedges.

fn square_cod(&self, sq: &Self::Sq) -> Self::ProE

Gets the codomain of a square, a single proedge.

fn square_src(&self, sq: &Self::Sq) -> Self::E

Gets the source of a square, an edge.

fn square_tgt(&self, sq: &Self::Sq) -> Self::E

Gets the target of a square, an edge.

Provided Methods

fn arity(&self, sq: &Self::Sq) -> usize

Gets the arity of a square.

The default implementation returns the length of the square’s domain.

Implementors

impl<VDC: VDblCategory> VDblGraph for UnderlyingDblGraph<VDC>

type V = <VDC as VDblCategory>::Ob

type E = <VDC as VDblCategory>::Arr

type ProE = <VDC as VDblCategory>::Pro

type Sq = <VDC as VDblCategory>::Cell