Trait GraphMapping

pub trait GraphMapping {
    type DomV: Eq + Clone;
    type DomE: Eq + Clone;
    type CodV: Eq + Clone;
    type CodE: Eq + Clone;

    // Required methods
    fn apply_vertex(&self, v: &Self::DomV) -> Option<Self::CodV>;
    fn apply_edge(&self, e: &Self::DomE) -> Option<Self::CodE>;
    fn is_vertex_assigned(&self, v: &Self::DomV) -> bool;
    fn is_edge_assigned(&self, e: &Self::DomE) -> bool;
}

A mapping between graphs.

Just as a Mapping is the data of a function without specified domain or codomain sets, a graph mapping is the data of a graph homomorphism without specified domain or codomain graphs. Turning this around, a graph morphism is a pair of graphs with a compatible graph mapping.

Required Associated Types

type DomV: Eq + Clone

Type of vertices in domain graph.

type DomE: Eq + Clone

Type of edges in domain graph.

type CodV: Eq + Clone

Type of vertices in codomain graph.

type CodE: Eq + Clone

Type of edges in codomain graph.

Required Methods

fn apply_vertex(&self, v: &Self::DomV) -> Option<Self::CodV>

Applies the graph mapping at a vertex.

fn apply_edge(&self, e: &Self::DomE) -> Option<Self::CodE>

Applies the graph mapping at an edge.

fn is_vertex_assigned(&self, v: &Self::DomV) -> bool

Is the mapping defined at a vertex?

fn is_edge_assigned(&self, e: &Self::DomE) -> bool

Is the mapping defined at an edge?

Implementors

impl<ColV, ColE> GraphMapping for ColumnarGraphMapping<ColV, ColE>

where ColV: MutMapping, ColE: MutMapping,

type DomV = <ColV as Mapping>::Dom

type DomE = <ColE as Mapping>::Dom

type CodV = <ColV as Mapping>::Cod

type CodE = <ColE as Mapping>::Cod