pub struct Graph<V, E> { /* private fields */ }Implementations§
Source§impl<V, E> Graph<V, E>
impl<V, E> Graph<V, E>
pub fn new() -> Graph<V, E>
pub fn with_capacity_and_hasher( capacity: usize, hash_builder: BuildHasherDefault<FnvHasher>, ) -> Graph<V, E>
pub fn insert_vertice(&mut self, vertice: V)
pub fn remove_edge(&mut self, vertice: &V, edge: &E)
pub fn add_edge(&mut self, vertice: &V, edge: E)
Auto Trait Implementations§
impl<V, E> Freeze for Graph<V, E>
impl<V, E> RefUnwindSafe for Graph<V, E>where
V: RefUnwindSafe,
E: RefUnwindSafe,
impl<V, E> Send for Graph<V, E>
impl<V, E> Sync for Graph<V, E>
impl<V, E> Unpin for Graph<V, E>
impl<V, E> UnsafeUnpin for Graph<V, E>
impl<V, E> UnwindSafe for Graph<V, E>where
V: UnwindSafe,
E: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more