Trait rs_graph::traits::GraphType

pub trait GraphType<'a> {
    type Node: 'a + Copy + Eq;
    type Edge: 'a + Copy + Eq;
}

Base information of a graph.

Associated Types

type Node: 'a + Copy + Eq

Type of a node.

type Edge: 'a + Copy + Eq

Type of an edge.

Loading content...

Implementations on Foreign Types

impl<'a, 'g: 'a, G> GraphType<'a> for &'g G where
    G: GraphType<'g>, 

type Node = G::Node

type Edge = G::Edge

Loading content...

Implementors

impl<'a, 'g: 'a, G> GraphType<'a> for InEdges<'g, G> where
    G: Directed<'g>, 

type Node = G::Node

type Edge = G::Edge

impl<'a, 'g: 'a, G> GraphType<'a> for Neighbors<'g, G> where
    G: GraphType<'g>, 

type Node = G::Node

type Edge = G::Edge

impl<'a, 'g: 'a, G> GraphType<'a> for OutEdges<'g, G> where
    G: Directed<'g>, 

type Node = G::Node

type Edge = G::Edge

impl<'a, A, P> GraphType<'a> for FilterAdjacencies<A, P> where
    A: Adjacencies<'a>, 

type Node = A::Node

type Edge = A::Edge

impl<'a, G> GraphType<'a> for Network<G> where
    G: Digraph<'a>, 

type Node = G::Node

type Edge = NetworkEdge<G::Edge>

impl<'a, G> GraphType<'a> for ReverseDigraph<G> where
    G: GraphType<'a>, 

type Node = G::Node

type Edge = G::Edge

impl<'a, G, Gx, Nx, Ex> GraphType<'a> for Attributed<G, Gx, Nx, Ex> where
    G: GraphType<'a>,
    Gx: Default,
    Nx: Default,
    Ex: Default, 

type Node = G::Node

type Edge = G::Edge

impl<'a, G, P> GraphType<'a> for FilteredGraph<'a, G, P> where
    G: GraphType<'a>,
    P: 'a + for<'r> Fn(&'r G::Edge) -> bool, 

type Node = G::Node

type Edge = G::Edge

impl<'a, ID, N, E> GraphType<'a> for LinkedListGraph<ID, N, E> where
    ID: 'a + PrimInt + Unsigned, 

type Node = Node<ID>

type Edge = Edge<ID>

Loading content...