[−][src]Struct petgraph::graph::Edge

pub struct Edge<E, Ix = DefaultIx> {
    pub weight: E,
    // some fields omitted
}
[−]

The graph's edge type.

Fields

weight: E
[−]

Associated edge data.

Implementations

impl<E, Ix: IndexType> Edge<E, Ix>[src][−]

pub fn next_edge(&self, dir: Direction) -> EdgeIndex<Ix>[src][−]

Accessor for data structure internals: the next edge for the given direction.

pub fn source(&self) -> NodeIndex<Ix>[src][−]

Return the source node index.

pub fn target(&self) -> NodeIndex<Ix>[src][−]

Return the target node index.

Trait Implementations

impl<E, Ix> Clone for Edge<E, Ix> where
    E: Clone,
    Ix: Copy, [src][+]

impl<E: Debug, Ix: Debug> Debug for Edge<E, Ix>[src][+]

Auto Trait Implementations

impl<E, Ix> RefUnwindSafe for Edge<E, Ix> where
    E: RefUnwindSafe,
    Ix: RefUnwindSafe, 

impl<E, Ix> Send for Edge<E, Ix> where
    E: Send,
    Ix: Send, 

impl<E, Ix> Sync for Edge<E, Ix> where
    E: Sync,
    Ix: Sync, 

impl<E, Ix> Unpin for Edge<E, Ix> where
    E: Unpin,
    Ix: Unpin, 

impl<E, Ix> UnwindSafe for Edge<E, Ix> where
    E: UnwindSafe,
    Ix: UnwindSafe, 

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src][+]

impl<T> Borrow<T> for T where
    T: ?Sized, [src][+]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src][+]

impl<T> From<T> for T[src][+]

impl<T, U> Into<U> for T where
    U: From<T>, [src][+]

impl<T> ToOwned for T where
    T: Clone, [src][+]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src][+]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src][+]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.