Trait fera_graph::graphs::VertexTypes

pub trait VertexTypes<'a, G: WithVertex> {
    type VertexIter: Iterator<Item = Vertex<G>>;
    type OutNeighborIter: Iterator<Item = Vertex<G>>;
}

Required Associated Types

type VertexIter: Iterator<Item = Vertex<G>>

type OutNeighborIter: Iterator<Item = Vertex<G>>

Implementations on Foreign Types

impl<'a, 'b, G: WithVertex> VertexTypes<'a, &'b G> for &'b G

type VertexIter = <G as VertexTypes<'a, G>>::VertexIter

type OutNeighborIter = <G as VertexTypes<'a, G>>::OutNeighborIter

Implementors

impl<'a, 'b, G> VertexTypes<'a, SpanningSubgraph<'b, G>> for SpanningSubgraph<'b, G>where
    G: 'b + WithEdge + WithVertexProp<Vec<Edge<G>>>,

type VertexIter = <G as VertexTypes<'b, G>>::VertexIter

type OutNeighborIter = OutNeighborFromOutEdge<'b, G, <SpanningSubgraph<'b, G> as EdgeTypes<'a, SpanningSubgraph<'b, G>>>::OutEdgeIter>

impl<'a, 'b, G> VertexTypes<'a, Subgraph<'b, G>> for Subgraph<'b, G>where
    G: 'b + Graph,

type VertexIter = Cloned<Iter<'a, <G as WithVertex>::Vertex>>

type OutNeighborIter = OutNeighborFromOutEdge<'b, G, <Subgraph<'b, G> as EdgeTypes<'a, Subgraph<'b, G>>>::OutEdgeIter>

impl<'a, K: CompleteEdgeKind> VertexTypes<'a, Complete<K>> for Complete<K>

type VertexIter = Range<<Complete<K> as WithVertex>::Vertex>

type OutNeighborIter = COutNeighborIter

impl<'a, V, K> VertexTypes<'a, AdjSet<V, K>> for AdjSet<V, K>where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>,

type VertexIter = Cloned<Keys<'a, V, HashSet<V, RandomState>>>

type OutNeighborIter = Cloned<Iter<'a, V>>

impl<'a, V: Num, K: StaticEdgeKind> VertexTypes<'a, Static<V, K>> for Static<V, K>

type VertexIter = <V as Num>::Range

type OutNeighborIter = OutNeighborFromOutEdge<'a, Static<V, K>, <Static<V, K> as EdgeTypes<'a, Static<V, K>>>::OutEdgeIter>