[−][src]Struct petgraph::graph::Node
The graph's node type.
Fields
weight: N
Associated node data.
Implementations
impl<N, Ix: IndexType> Node<N, Ix>
[src][−]
pub fn next_edge(&self, dir: Direction) -> EdgeIndex<Ix>
[src][−]
Accessor for data structure internals: the first edge in the given direction.
Trait Implementations
impl<E, Ix> Clone for Node<E, Ix> where
E: Clone,
Ix: Copy,
[src][+]
E: Clone,
Ix: Copy,
impl<N: Debug, Ix: Debug> Debug for Node<N, Ix>
[src][+]
Auto Trait Implementations
impl<N, Ix> RefUnwindSafe for Node<N, Ix> where
Ix: RefUnwindSafe,
N: RefUnwindSafe,
Ix: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, Ix> Send for Node<N, Ix> where
Ix: Send,
N: Send,
Ix: Send,
N: Send,
impl<N, Ix> Sync for Node<N, Ix> where
Ix: Sync,
N: Sync,
Ix: Sync,
N: Sync,
impl<N, Ix> Unpin for Node<N, Ix> where
Ix: Unpin,
N: Unpin,
Ix: Unpin,
N: Unpin,
impl<N, Ix> UnwindSafe for Node<N, Ix> where
Ix: UnwindSafe,
N: UnwindSafe,
Ix: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> From<T> for T
[src][+]
impl<T, U> Into<U> for T where
U: From<T>,
[src][+]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src][+]
T: Clone,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,