Trait fera_graph::graphs::Incidence

pub trait Incidence: WithEdge + Adjacency {
    fn out_edges(&self, v: Vertex<Self>) -> OutEdgeIter<Self>;

    fn out_edges_ends(
        &self, 
        v: Vertex<Self>
    ) -> EdgesEnds<Self, OutEdgeIter<Self>> { ... }
    fn out_edges_with_ends(
        &self, 
        v: Vertex<Self>
    ) -> EdgesWithEnds<Self, OutEdgeIter<Self>> { ... }
}

Required Methods

fn out_edges(&self, v: Vertex<Self>) -> OutEdgeIter<Self>

Provided Methods

fn out_edges_ends(&self, v: Vertex<Self>) -> EdgesEnds<Self, OutEdgeIter<Self>>

fn out_edges_with_ends(
    &self,
    v: Vertex<Self>
) -> EdgesWithEnds<Self, OutEdgeIter<Self>>

Implementations on Foreign Types

impl<'a, G: Incidence> Incidence for &'a G

fn out_edges(&self, v: Vertex<Self>) -> OutEdgeIter<Self>

fn out_edges_ends(&self, v: Vertex<Self>) -> EdgesEnds<Self, OutEdgeIter<Self>>

fn out_edges_with_ends(
    &self,
    v: Vertex<Self>
) -> EdgesWithEnds<Self, OutEdgeIter<Self>>

Implementors

• impl<'a, G> Incidence for Subgraph<'a, G> where
    G: 'a + Graph, 
• impl<'a, G> Incidence for SpanningSubgraph<'a, G> where
    G: 'a + WithEdge + WithVertexProp<Vec<Edge<G>>>, 
• impl<V, K> Incidence for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 
• impl<K: CompleteEdgeKind> Incidence for Complete<K>
• impl<V: Num, K: StaticEdgeKind> Incidence for Static<V, K>