Struct rustc_data_structures::graph::implementation::Graph

pub struct Graph<N, E> { /* fields omitted */ }

Methods

impl<N: Debug, E: Debug> Graph<N, E>

pub fn new() -> Graph<N, E>

pub fn with_capacity(nodes: usize, edges: usize) -> Graph<N, E>

Important traits for &'_ [u8]

impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

pub fn all_nodes(&self) -> &[Node<N>]

pub fn len_nodes(&self) -> usize

Important traits for &'_ [u8]

impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

pub fn all_edges(&self) -> &[Edge<E>]

pub fn len_edges(&self) -> usize

pub fn next_node_index(&self) -> NodeIndex

pub fn add_node(&mut self, data: N) -> NodeIndex

Important traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

pub fn mut_node_data(&mut self, idx: NodeIndex) -> &mut N

Important traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

pub fn node_data(&self, idx: NodeIndex) -> &N

pub fn node(&self, idx: NodeIndex) -> &Node<N>

pub fn next_edge_index(&self) -> EdgeIndex

pub fn add_edge(
    &mut self,
    source: NodeIndex,
    target: NodeIndex,
    data: E
) -> EdgeIndex

pub fn edge(&self, idx: EdgeIndex) -> &Edge<E>

pub fn enumerated_nodes(&self) -> impl Iterator<Item = (NodeIndex, &Node<N>)>

pub fn enumerated_edges(&self) -> impl Iterator<Item = (EdgeIndex, &Edge<E>)>

pub fn each_node<'a>(
    &'a self,
    f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool

Iterates over all edges defined in the graph.

pub fn each_edge<'a>(
    &'a self,
    f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool

Iterates over all edges defined in the graph

Important traits for AdjacentEdges<'g, N, E>

impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>

Important traits for AdjacentEdges<'g, N, E>

impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>

Important traits for AdjacentEdges<'g, N, E>

impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn adjacent_edges(
    &self,
    source: NodeIndex,
    direction: Direction
) -> AdjacentEdges<N, E>

pub fn successor_nodes<'a>(
    &'a self,
    source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

pub fn predecessor_nodes<'a>(
    &'a self,
    target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

Important traits for DepthFirstTraversal<'g, N, E>

impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;

pub fn depth_traverse<'a>(
    &'a self,
    start: NodeIndex,
    direction: Direction
) -> DepthFirstTraversal<'a, N, E>

pub fn nodes_in_postorder(
    &self,
    direction: Direction,
    entry_node: NodeIndex
) -> Vec<NodeIndex>