Skip to main content

IncomingGraph

Trait IncomingGraph 

Source
pub trait IncomingGraph: TopologyBase {
    type InEdges<'view>: Iterator<Item = Self::RelationId>
       where Self: 'view;

    // Required method
    fn incoming_edges(&self, node: Self::ElementId) -> Self::InEdges<'_>;
}
Expand description

Capability for traversing incoming edges to a target node.

Separate from OutgoingGraph because many layouts only provide one direction cheaply.

Required Associated Types§

Source

type InEdges<'view>: Iterator<Item = Self::RelationId> where Self: 'view

Iterator over edge IDs entering one target node.

Required Methods§

Source

fn incoming_edges(&self, node: Self::ElementId) -> Self::InEdges<'_>

Returns edges whose target is node.

Dyn Compatibility§

This trait is not dyn compatible.

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

Implementors§