Struct acyclic_graph::Graph [−][src]
pub struct Graph<V, E> { /* fields omitted */ }
Implementations
impl<V, E> Graph<V, E> where
V: Eq + Hash,
E: Eq,
[src]
impl<V, E> Graph<V, E> where
V: Eq + Hash,
E: Eq,
[src]pub fn new() -> Graph<V, E>
[src]
pub fn with_capacity_and_hasher(
capacity: usize,
hash_builder: BuildHasherDefault<FnvHasher>
) -> Graph<V, E>
[src]
capacity: usize,
hash_builder: BuildHasherDefault<FnvHasher>
) -> Graph<V, E>
pub fn insert_vertice(&mut self, vertice: V)
[src]
pub fn remove_edge(&mut self, vertice: &V, edge: &E)
[src]
pub fn add_edge(&mut self, vertice: &V, edge: E)
[src]
Auto Trait Implementations
impl<V, E> RefUnwindSafe for Graph<V, E> where
E: RefUnwindSafe,
V: RefUnwindSafe,
E: RefUnwindSafe,
V: RefUnwindSafe,
impl<V, E> Send for Graph<V, E> where
E: Send,
V: Send,
E: Send,
V: Send,
impl<V, E> Sync for Graph<V, E> where
E: Sync,
V: Sync,
E: Sync,
V: Sync,
impl<V, E> Unpin for Graph<V, E> where
E: Unpin,
V: Unpin,
E: Unpin,
V: Unpin,
impl<V, E> UnwindSafe for Graph<V, E> where
E: UnwindSafe,
V: UnwindSafe,
E: UnwindSafe,
V: UnwindSafe,