Trait Edge 

pub trait Edge<'graph> {
    type Graph: Graph;

    // Required methods
    fn new(
        id: <Self::Graph as Graph>::EdgeId,
        graph: &'graph Self::Graph,
    ) -> Self;
    fn id(&self) -> <Self::Graph as Graph>::EdgeId;
    fn graph(&self) -> &'graph Self::Graph;
    fn from_id(&self) -> <Self::Graph as Graph>::NodeId;
    fn to_id(&self) -> <Self::Graph as Graph>::NodeId;

    // Provided methods
    fn from(&self) -> <Self::Graph as Graph>::Node<'graph> { ... }
    fn to(&self) -> <Self::Graph as Graph>::Node<'graph> { ... }
    fn is_loop(&self) -> bool { ... }
}

Typed edge handle trait for immutable graph references.

Required Associated Types

type Graph: Graph

Required Methods

fn new(id: <Self::Graph as Graph>::EdgeId, graph: &'graph Self::Graph) -> Self

fn id(&self) -> <Self::Graph as Graph>::EdgeId

Returns this edge identifier.

fn graph(&self) -> &'graph Self::Graph

Returns the backing graph reference for this edge.

fn from_id(&self) -> <Self::Graph as Graph>::NodeId

Returns the source node’s id for this edge.

fn to_id(&self) -> <Self::Graph as Graph>::NodeId

Returns the destination node’s id for this edge.

Provided Methods

fn from(&self) -> <Self::Graph as Graph>::Node<'graph>

Returns the source node for this edge

fn to(&self) -> <Self::Graph as Graph>::Node<'graph>

Returns the destination node for this edge

fn is_loop(&self) -> bool

Returns true when this edge starts and ends at the same node.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl<'graph, NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> Edge<'graph> for EdgeRef<'graph, NodeId, EdgeId, NodeData, EdgeData>

type Graph = OwningGraph<NodeId, EdgeId, NodeData, EdgeData>