Struct petgraph::graph::NodeIndex [−][src]
Node identifier.
Implementations
impl<Ix: IndexType> NodeIndex<Ix>
[src]
Trait Implementations
impl<Ix: Clone> Clone for NodeIndex<Ix>
[src]
impl<Ix: Copy> Copy for NodeIndex<Ix>
[src]
impl<Ix: Debug> Debug for NodeIndex<Ix>
[src]
impl<Ix: Default> Default for NodeIndex<Ix>
[src]
impl<'de, Ix> Deserialize<'de> for NodeIndex<Ix> where
Ix: IndexType + Deserialize<'de>,
[src]
Ix: IndexType + Deserialize<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
D: Deserializer<'de>,
[src]
D: Deserializer<'de>,
impl<Ix: Eq> Eq for NodeIndex<Ix>
[src]
impl<Ix: IndexType> From<Ix> for NodeIndex<Ix>
[src]
impl<Ix: IndexType> GraphIndex for NodeIndex<Ix>
[src]
impl<Ix: Hash> Hash for NodeIndex<Ix>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the Graph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the StableGraph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> Index<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
[src]
Index the MatrixGraph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the Graph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the StableGraph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IndexMut<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
[src]
Index the MatrixGraph
by NodeIndex
to access node weights.
Panics if the node doesn't exist.
impl<Ix: IndexType> IndexType for NodeIndex<Ix>
[src]
impl<Ix: Ord> Ord for NodeIndex<Ix>
[src]
fn cmp(&self, other: &NodeIndex<Ix>) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl<Ix: PartialEq> PartialEq<NodeIndex<Ix>> for NodeIndex<Ix>
[src]
impl<Ix: PartialOrd> PartialOrd<NodeIndex<Ix>> for NodeIndex<Ix>
[src]
fn partial_cmp(&self, other: &NodeIndex<Ix>) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl<Ix> Serialize for NodeIndex<Ix> where
Ix: IndexType + Serialize,
[src]
Ix: IndexType + Serialize,
impl<Ix> StructuralEq for NodeIndex<Ix>
[src]
impl<Ix> StructuralPartialEq for NodeIndex<Ix>
[src]
Auto Trait Implementations
impl<Ix> RefUnwindSafe for NodeIndex<Ix> where
Ix: RefUnwindSafe,
[src]
Ix: RefUnwindSafe,
impl<Ix> Send for NodeIndex<Ix> where
Ix: Send,
[src]
Ix: Send,
impl<Ix> Sync for NodeIndex<Ix> where
Ix: Sync,
[src]
Ix: Sync,
impl<Ix> Unpin for NodeIndex<Ix> where
Ix: Unpin,
[src]
Ix: Unpin,
impl<Ix> UnwindSafe for NodeIndex<Ix> where
Ix: UnwindSafe,
[src]
Ix: 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,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
pub fn equivalent(&self, key: &K) -> bool
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<Ix> NodeRef for Ix where
Ix: IndexType,
[src]
Ix: IndexType,
type NodeId = Ix
type Weight = ()
pub fn id(&Self) -> <Ix as NodeRef>::NodeId
[src]
pub fn weight(&Self) -> &<Ix as NodeRef>::Weight
[src]
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut 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.
pub 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.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,