Trait DirectedGraph

pub trait DirectedGraph {
    type Node: Idx;

    // Required method
    fn num_nodes(&self) -> usize;

    // Provided method
    fn iter_nodes(
        &self,
    ) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator { ... }
}

Required Associated Types

type Node: Idx

Required Methods

fn num_nodes(&self) -> usize

Returns the total number of nodes in this graph.

Several graph algorithm implementations assume that every node ID is strictly less than the number of nodes, i.e. nodes are densely numbered. That assumption allows them to use num_nodes to allocate per-node data structures, indexed by node.

Provided Methods

fn iter_nodes( &self, ) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator

Iterates over all nodes of a graph in ascending numeric order.

Assumes that nodes are densely numbered, i.e. every index in 0..num_nodes is a valid node.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'graph, G: DirectedGraph> DirectedGraph for &'graph G

type Node = <G as DirectedGraph>::Node

fn num_nodes(&self) -> usize

Implementors

impl<G: DirectedGraph> DirectedGraph for ReversedGraph<G>

type Node = <G as DirectedGraph>::Node

impl<N: Idx, S: Idx + Ord, A: Annotation> DirectedGraph for Sccs<N, S, A>

type Node = S

impl<N: Idx, const BR: bool> DirectedGraph for VecGraph<N, BR>

type Node = N

impl<'a, 'tcx, D: ConstraintGraphDirection> DirectedGraph for RegionGraph<'a, 'tcx, D>

impl<'tcx> DirectedGraph for BasicBlocks<'tcx>

impl DirectedGraph for CoverageGraph

impl<'a, 'tcx> DirectedGraph for CoverageRelevantSubgraph<'a, 'tcx>

impl<G> DirectedGraph for BalancedFlowGraph<G>

where G: DirectedGraph,