[][src]Struct generic_graph::adjacency_list::AdjacencyGraph

pub struct AdjacencyGraph<K, V, W> where
    K: Hash + Eq + Clone,
    W: Sum + Eq + Ord + Copy
{ /* fields omitted */ }

Methods

impl<K: Hash + Eq + Clone, V, W: Sum + Eq + Ord + Copy> AdjacencyGraph<K, V, W>[src]

pub fn new() -> AdjacencyGraph<K, V, W>[src]

Trait Implementations

impl<K: Hash + Eq + Clone, V, W: Sum + Eq + Ord + Copy> DirectedGraph<SimpleVertex<K, V>, DirectedEdge<K, W>, K, V, W, CompoundKey<K>> for AdjacencyGraph<K, V, W>[src]

Auto Trait Implementations

impl<K, V, W> RefUnwindSafe for AdjacencyGraph<K, V, W> where
    K: RefUnwindSafe,
    V: RefUnwindSafe,
    W: RefUnwindSafe

impl<K, V, W> Send for AdjacencyGraph<K, V, W> where
    K: Send,
    V: Send,
    W: Send

impl<K, V, W> Sync for AdjacencyGraph<K, V, W> where
    K: Sync,
    V: Sync,
    W: Sync

impl<K, V, W> Unpin for AdjacencyGraph<K, V, W> where
    K: Unpin,
    V: Unpin,
    W: Unpin

impl<K, V, W> UnwindSafe for AdjacencyGraph<K, V, W> where
    K: UnwindSafe,
    V: UnwindSafe,
    W: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.