Trait swh_graph::graph::SwhLabelledBackwardGraph

pub trait SwhLabelledBackwardGraph: SwhBackwardGraph {
    type LabelledArcs<'arc>: IntoIterator<Item = UntypedEdgeLabel>
       where Self: 'arc;
    type LabelledPredecessors<'node>: IntoIterator<Item = (usize, Self::LabelledArcs<'node>)>
       where Self: 'node;

    // Required method
    fn labelled_predecessors(
        &self,
        node_id: NodeId
    ) -> Self::LabelledPredecessors<'_>;
}

Required Associated Types

type LabelledArcs<'arc>: IntoIterator<Item = UntypedEdgeLabel> where Self: 'arc

type LabelledPredecessors<'node>: IntoIterator<Item = (usize, Self::LabelledArcs<'node>)> where Self: 'node

Required Methods

fn labelled_predecessors( &self, node_id: NodeId ) -> Self::LabelledPredecessors<'_>

Return an IntoIterator over the successors of a node.

Object Safety

This trait is not object safe.

Implementors

impl<G: SwhLabelledBackwardGraph> SwhLabelledBackwardGraph for GraphSpy<G>

type LabelledArcs<'arc> = <G as SwhLabelledBackwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'succ> = <G as SwhLabelledBackwardGraph>::LabelledPredecessors<'succ> where Self: 'succ

impl<G: SwhLabelledBackwardGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhLabelledBackwardGraph for Subgraph<G, NodeFilter, ArcFilter>

type LabelledArcs<'arc> = <G as SwhLabelledBackwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'node> = FilteredLabelledPredecessors<'node, <Subgraph<G, NodeFilter, ArcFilter> as SwhLabelledBackwardGraph>::LabelledArcs<'node>, <<G as SwhLabelledBackwardGraph>::LabelledPredecessors<'node> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'node

impl<G: SwhLabelledForwardGraph> SwhLabelledBackwardGraph for Transposed<G>

type LabelledArcs<'arc> = <G as SwhLabelledForwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'succ> = <G as SwhLabelledForwardGraph>::LabelledSuccessors<'succ> where Self: 'succ

impl<P, FG: UnderlyingGraph, BG: UnderlyingGraph> SwhLabelledBackwardGraph for SwhBidirectionalGraph<P, FG, BG>where <BG as SequentialLabeling>::Label: Pair<Left = NodeId>, <<BG as SequentialLabeling>::Label as Pair>::Right: IntoIterator, <<<BG as SequentialLabeling>::Label as Pair>::Right as IntoIterator>::Item: Borrow<u64>, for<'succ> <BG as RandomAccessLabeling>::Labels<'succ>: Iterator<Item = (usize, <<BG as SequentialLabeling>::Label as Pair>::Right)>,

type LabelledArcs<'arc> = LabelledArcIterator<<<<<BG as RandomAccessLabeling>::Labels<'arc> as Iterator>::Item as Pair>::Right as IntoIterator>::IntoIter> where Self: 'arc

type LabelledPredecessors<'succ> = LabelledSuccessorIterator<<BG as RandomAccessLabeling>::Labels<'succ>> where Self: 'succ

impl<T: Deref> SwhLabelledBackwardGraph for Twhere <T as Deref>::Target: SwhLabelledBackwardGraph,

type LabelledArcs<'arc> = <<T as Deref>::Target as SwhLabelledBackwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'succ> = <<T as Deref>::Target as SwhLabelledBackwardGraph>::LabelledPredecessors<'succ> where Self: 'succ