Trait swh_graph::graph::SwhForwardGraph

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

    // Required methods
    fn successors(&self, node_id: NodeId) -> Self::Successors<'_>;
    fn outdegree(&self, node_id: NodeId) -> usize;
}

Required Associated Types

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

Required Methods

fn successors(&self, node_id: NodeId) -> Self::Successors<'_>

Return an IntoIterator over the successors of a node.

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

Return the number of successors of a node.

Object Safety

This trait is not object safe.

Implementors

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

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

impl<G: SwhForwardGraph> SwhForwardGraph for GraphSpy<G>

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

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

type Successors<'succ> = FilteredSuccessors<'succ, <<G as SwhForwardGraph>::Successors<'succ> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'succ

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

type Successors<'succ> = <FG as UnderlyingGraph>::UnlabeledSuccessors<'succ> where Self: 'succ

impl<P, G: UnderlyingGraph> SwhForwardGraph for SwhUnidirectionalGraph<P, G>

type Successors<'succ> = <G as UnderlyingGraph>::UnlabeledSuccessors<'succ> where Self: 'succ

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

type Successors<'succ> = <<T as Deref>::Target as SwhForwardGraph>::Successors<'succ> where Self: 'succ