Trait Graph

pub trait Graph {
    type V: Eq + Clone;
    type E: Eq + Clone;

    // Required methods
    fn has_vertex(&self, v: &Self::V) -> bool;
    fn has_edge(&self, e: &Self::E) -> bool;
    fn src(&self, e: &Self::E) -> Self::V;
    fn tgt(&self, e: &Self::E) -> Self::V;
}

A graph.

This is a graph in the category theorist’s sense, i.e., it is directed and admits multiple edges and self loops. Moreover, a graph is not assumed to be finite, even locally.

Required Associated Types

type V: Eq + Clone

Type of vertices in graph.

type E: Eq + Clone

Type of edges in graph.

Required Methods

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

Does the graph contain the value as a vertex?

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

Does the graph contain the value as an edge?

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

Gets the source of an edge, assumed to be contained in the graph.

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

Gets the target of an edge, assumed to be contained in the graph.

Implementors

impl<Cat: Category> Graph for UnderlyingGraph<Cat>

type V = <Cat as Category>::Ob

type E = <Cat as Category>::Mor

impl<G: ColumnarGraph> Graph for G

type V = <G as ColumnarGraph>::V

type E = <G as ColumnarGraph>::E

impl<VDG: VDblGraph> Graph for EdgeGraph<VDG>

type V = <VDG as VDblGraph>::V

type E = <VDG as VDblGraph>::E

impl<VDG: VDblGraph> Graph for ProedgeGraph<VDG>

type V = <VDG as VDblGraph>::V

type E = <VDG as VDblGraph>::ProE