Struct BidirectedEdge 

pub struct BidirectedEdge<IndexType, EdgeData> {
    pub from: NodeIndex<IndexType>,
    pub from_forward: bool,
    pub to: NodeIndex<IndexType>,
    pub to_forward: bool,
    pub data: EdgeData,
}

Fields

from: NodeIndex<IndexType>

from_forward: bool

True if this edge originates from the forward side of the from node.

to: NodeIndex<IndexType>

to_forward: bool

True if this edge terminates at the forward side of the to node.

data: EdgeData

Trait Implementations

impl<IndexType: Clone, EdgeData: Clone> Clone for BidirectedEdge<IndexType, EdgeData>

fn clone(&self) -> BidirectedEdge<IndexType, EdgeData>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<IndexType: Debug, EdgeData: Debug> Debug for BidirectedEdge<IndexType, EdgeData>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<IndexType: Hash, EdgeData: Hash> Hash for BidirectedEdge<IndexType, EdgeData>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<IndexType: PartialEq, EdgeData: PartialEq> PartialEq for BidirectedEdge<IndexType, EdgeData>

fn eq(&self, other: &BidirectedEdge<IndexType, EdgeData>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<IndexType: Eq, EdgeData: Eq> Eq for BidirectedEdge<IndexType, EdgeData>

impl<IndexType, EdgeData> StructuralPartialEq for BidirectedEdge<IndexType, EdgeData>