Struct fera_graph::graphs::adjset::AdjSet

pub struct AdjSet<V: AdjSetVertex, K: AdjSetEdgeKind<V>> { /* fields omitted */ }

Methods

impl<V, K> AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

fn new() -> Self

fn add_vertex(&mut self, v: V)

fn add_edge(&mut self, u: V, v: V) -> K::Edge

Trait Implementations

impl<V, K> Default for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

fn default() -> Self

Returns the "default value" for a type.

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>>>

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

impl<V, K> WithVertex for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

type Vertex = V

type OptionVertex = Option<V>

fn vertex_none() -> OptionVertex<Self>

fn vertex_some(v: Vertex<Self>) -> OptionVertex<Self>

fn vertex_prop<P, T>(&self, value: T) -> P where
    P: VertexPropMutNew<Self, T>,
    T: Clone, 

fn vertex_prop_from_fn<P, T, F>(&self, fun: F) -> P where
    Self: VertexList,
    P: VertexPropMutNew<Self, T>,
    F: FnMut(Vertex<Self>) -> T,
    T: Default + Clone, 

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

type EdgeIter = Edges<'a, V, K>

type OutEdgeIter = OutEdges<'a, V, K>

impl<V, K> WithEdge for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

type Kind = K

type Edge = K::Edge

type OptionEdge = Option<K::Edge>

fn source(&self, e: Edge<Self>) -> Vertex<Self>

fn target(&self, e: Edge<Self>) -> Vertex<Self>

fn orientation(&self, _e: Edge<Self>) -> Orientation

fn get_reverse(&self, e: Edge<Self>) -> Option<Edge<Self>>

fn ends<'a, I, O>(&'a self, item: I) -> O where
    I: Ends<'a, Self, O>, 

fn end_vertices(&self, e: Edge<Self>) -> (Vertex<Self>, Vertex<Self>)

fn with_ends<I>(&self, iter: I) -> EdgesWithEnds<Self, I::IntoIter> where
    I: IntoIterator,
    I::Item: IntoOwned<Edge<Self>>, 

fn opposite(&self, u: Vertex<Self>, e: Edge<Self>) -> Vertex<Self>

fn is_incident(&self, v: Vertex<Self>, e: Edge<Self>) -> bool

fn reverse(&self, e: Edge<Self>) -> Edge<Self> where
    Self: WithEdge<Kind = Undirected>, 

fn edge_none() -> OptionEdge<Self>

fn edge_some(e: Edge<Self>) -> OptionEdge<Self>

fn edge_prop<P, T>(&self, value: T) -> P where
    P: EdgePropMutNew<Self, T>,
    T: Clone, 

fn edge_prop_from_fn<P, F, T>(&self, fun: F) -> P where
    Self: EdgeList,
    P: EdgePropMutNew<Self, T>,
    F: FnMut(Edge<Self>) -> T,
    T: Default + Clone, 

impl<V, K> VertexList for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

fn vertices(&self) -> VertexIter<Self>

fn num_vertices(&self) -> usize

impl<V, K> EdgeList for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

fn edges(&self) -> EdgeIter<Self>

fn num_edges(&self) -> usize

fn get_edge_by_ends(
    &self,
    u: Vertex<Self>,
    v: Vertex<Self>
) -> Option<Edge<Self>>

fn edges_ends(&self) -> EdgesEnds<Self, EdgeIter<Self>>

fn edges_with_ends(&self) -> EdgesWithEnds<Self, EdgeIter<Self>>

fn edge_by_ends(&self, u: Vertex<Self>, v: Vertex<Self>) -> Edge<Self>

impl<V, K> Adjacency for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

fn out_neighbors(&self, v: Vertex<Self>) -> OutNeighborIter<Self>

fn out_degree(&self, v: Vertex<Self>) -> usize

impl<V, K> Incidence for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>, 

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>>

impl<V, K, T> WithVertexProp<T> for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>,
    T: Clone, 

type VertexProp = HashMapProp<V, T>

The vertex property type.

fn default_vertex_prop(&self, value: T) -> DefaultVertexPropMut<Self, T> where
    T: Clone, 

Creates a new default vertex property where the initial value associated with each vertex is value.

fn default_vertex_prop_from_fn<P, F>(&self, fun: F) -> P where
    Self: VertexList,
    P: VertexPropMutNew<Self, T>,
    F: FnMut(Vertex<Self>) -> T,
    T: Default + Clone, 

Creates a new default vertex property where the initial value associated with each vertex v is produced by fun(v).

impl<V, K, T> WithEdgeProp<T> for AdjSet<V, K> where
    V: AdjSetVertex,
    K: AdjSetEdgeKind<V>,
    T: Clone, 

type EdgeProp = HashMapProp<K::Edge, T>

fn default_edge_prop(&self, value: T) -> DefaultEdgePropMut<Self, T> where
    T: Clone, 

Creates a new default edge property where the initial value associated with each edge is value.

fn default_edge_prop_from_fn<P, F>(&self, fun: F) -> P where
    Self: EdgeList,
    P: EdgePropMutNew<Self, T>,
    F: FnMut(Edge<Self>) -> T,
    T: Default + Clone, 

Creates a new default edge property where the initial value associated with each edge e is produced by fun(e).