Struct rustc_data_structures::graph::vec_graph::VecGraph

pub struct VecGraph<N: Idx> {
    node_starts: IndexVec<N, usize>,
    edge_targets: Vec<N>,
}

Fields

node_starts: IndexVec<N, usize>

Maps from a given node to an index where the set of successors for that node starts. The index indexes into the edges vector. To find the range for a given node, we look up the start for that node and then the start for the next node (i.e., with an index 1 higher) and get the range between the two. This vector always has an extra entry so that this works even for the max element.

edge_targets: Vec<N>

Implementations

impl<N: Idx + Ord> VecGraph<N>

pub fn new(num_nodes: usize, edge_pairs: Vec<(N, N)>) -> Self

pub fn successors(&self, source: N) -> &[N]

Gets the successors for source as a slice.

Trait Implementations

impl<N: Idx> DirectedGraph for VecGraph<N>

type Node = N

impl<'graph, N: Idx> GraphSuccessors<'graph> for VecGraph<N>

type Item = N

type Iter = Cloned<Iter<'graph, N>>

impl<N: Idx> WithNumEdges for VecGraph<N>

fn num_edges(&self) -> usize

impl<N: Idx> WithNumNodes for VecGraph<N>

fn num_nodes(&self) -> usize

impl<N: Idx + Ord> WithSuccessors for VecGraph<N>

fn successors(&self, node: N) -> <Self as GraphSuccessors<'_>>::Iter

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> where
    Self: WithNumNodes,

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 48 bytes