Trait swh_graph::graph::SwhBackwardGraph

pub trait SwhBackwardGraph: SwhGraph {
    type Predecessors<'succ>: IntoIterator<Item = usize>
       where Self: 'succ;

    // Required methods
    fn predecessors(&self, node_id: NodeId) -> Self::Predecessors<'_>;
    fn indegree(&self, node_id: NodeId) -> usize;
}

Required Associated Types

type Predecessors<'succ>: IntoIterator<Item = usize> where Self: 'succ

Required Methods

fn predecessors(&self, node_id: NodeId) -> Self::Predecessors<'_>

Return an IntoIterator over the predecessors of a node.

fn indegree(&self, node_id: NodeId) -> usize

Return the number of predecessors of a node.

Object Safety

This trait is not object safe.

Implementors

impl<G: SwhBackwardGraph> SwhBackwardGraph for GraphSpy<G>

type Predecessors<'succ> = <G as SwhBackwardGraph>::Predecessors<'succ> where Self: 'succ

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

type Predecessors<'succ> = FilteredPredecessors<'succ, <<G as SwhBackwardGraph>::Predecessors<'succ> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'succ

impl<G: SwhForwardGraph> SwhBackwardGraph for Transposed<G>

type Predecessors<'succ> = <G as SwhForwardGraph>::Successors<'succ> where Self: 'succ

impl<P, FG: UnderlyingGraph, BG: UnderlyingGraph> SwhBackwardGraph for SwhBidirectionalGraph<P, FG, BG>

type Predecessors<'succ> = <BG as UnderlyingGraph>::UnlabeledSuccessors<'succ> where Self: 'succ

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

type Predecessors<'succ> = <<T as Deref>::Target as SwhBackwardGraph>::Predecessors<'succ> where Self: 'succ