Struct rustc_ap_rustc_data_structures::graph::implementation::Graph [−][src]
pub struct Graph<N, E> { /* fields omitted */ }
Implementations
Iterates over all edges defined in the graph.
Iterates over all edges defined in the graph
pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);
[src]pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);
[src]pub fn adjacent_edges(
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);
[src]pub fn successor_nodes<'a>(
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
[src]pub fn predecessor_nodes<'a>(
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
[src]pub fn depth_traverse(
&self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'_, N, E>ⓘNotable traits for DepthFirstTraversal<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;
[src]Auto Trait Implementations
impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe,
N: UnwindSafe,