[][src]Struct algorithms_edu::algo::graph::Edge

pub struct Edge {
    pub to: usize,
    pub weight: f64,
}

The Edge type used in WeightedAdjacencyList. A from field is not required because it's implied by its position in the adjacency list.

Fields

to: usizeweight: f64

Implementations

impl Edge[src]

pub fn new(to: usize, weight: f64) -> Self[src]

Consruct a new (directed) weighted Edge

Trait Implementations

impl Clone for Edge[src]

impl Copy for Edge[src]

impl Debug for Edge[src]

Auto Trait Implementations

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.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,