Trait rs_graph::attributed::AttributedNetwork

pub trait AttributedNetwork<'a>: AttributedGraph<'a>where
    Self::Graph: Network<'a>,
    Self::Attributes: 'a + NetworkAttributes<Node = <<Self as AttributedGraph<'a>>::Graph as Graph<'a>>::Node, Edge = <<Self as AttributedGraph<'a>>::Graph as Graph<'a>>::Edge>,{
    fn biedge(
        &'a self,
        e: <Self::Graph as Graph<'a>>::Edge
    ) -> &'a <Self::Attributes as NetworkAttributes>::BiEdgeAttr;
    fn biedge_mut(
        &'a mut self,
        e: <Self::Graph as Graph<'a>>::Edge
    ) -> &'a mut <Self::Attributes as NetworkAttributes>::BiEdgeAttr;
}

An attributed network.

This trait adds another type of attributes to a graph: attributes associated with each forward and backward edge of a network (i.e. with so called “biedges”).

Required Methods

fn biedge(
    &'a self,
    e: <Self::Graph as Graph<'a>>::Edge
) -> &'a <Self::Attributes as NetworkAttributes>::BiEdgeAttr

Return the attributes of a biedge.

fn biedge_mut(
    &'a mut self,
    e: <Self::Graph as Graph<'a>>::Edge
) -> &'a mut <Self::Attributes as NetworkAttributes>::BiEdgeAttr

Return the attributes of a biedge.

Implementors

impl<'a, G, Gx, Nx, Ex, Ax> AttributedNetwork<'a> for Attributed<G, Gx, Nx, Ex, Ax>where
    G: 'a + IndexNetwork<'a>,
    Gx: 'a + Default,
    Nx: 'a + Default,
    Ex: 'a + Default,
    Ax: 'a + Default,