[−][src]Struct s3graph::DiGraph
Methods
impl<V, L> DiGraph<V, L> where
V: Hash + Eq + Copy,
L: Copy, [src]
V: Hash + Eq + Copy,
L: Copy,
pub fn new() -> Self[src]
pub fn add_node(&mut self, node: V)[src]
Adds a node to the graph, with no incoming or outgoing edges.
Panics
if the the node is already present.
pub fn has_node(&self, node: V) -> bool[src]
pub fn nodes(&self) -> &[V][src]
pub fn add_edge(&mut self, source: V, target: V, label: L)[src]
Inserts a new edge into the graph. The source and target nodes are added to the graph if they were not previously recorded
pub fn insert_node_if_absent(&mut self, node: V)[src]
pub fn incoming_edges(&self, source: V) -> &[Edge<V, L>][src]
pub fn outgoing_edges(&self, target: V) -> &[Edge<V, L>][src]
Auto Trait Implementations
impl<V, L> Send for DiGraph<V, L> where
L: Send,
V: Send,
L: Send,
V: Send,
impl<V, L> Unpin for DiGraph<V, L> where
L: Unpin,
V: Unpin,
L: Unpin,
V: Unpin,
impl<V, L> Sync for DiGraph<V, L> where
L: Sync,
V: Sync,
L: Sync,
V: Sync,
impl<V, L> UnwindSafe for DiGraph<V, L> where
L: UnwindSafe,
V: UnwindSafe,
L: UnwindSafe,
V: UnwindSafe,
impl<V, L> RefUnwindSafe for DiGraph<V, L> where
L: RefUnwindSafe,
V: RefUnwindSafe,
L: RefUnwindSafe,
V: RefUnwindSafe,
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> From<T> for T[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,