[−][src]Struct rustc_data_structures::graph::implementation::Graph
Methods
impl<N: Debug, E: Debug> Graph<N, E>
[src]
pub fn new() -> Graph<N, E>
[src]
pub fn with_capacity(nodes: usize, edges: usize) -> Graph<N, E>
[src]
pub fn all_nodes(&self) -> &[Node<N>]
[src]
pub fn len_nodes(&self) -> usize
[src]
pub fn all_edges(&self) -> &[Edge<E>]
[src]
pub fn len_edges(&self) -> usize
[src]
pub fn next_node_index(&self) -> NodeIndex
[src]
pub fn add_node(&mut self, data: N) -> NodeIndex
[src]
ⓘImportant traits for &'_ mut Ipub fn mut_node_data(&mut self, idx: NodeIndex) -> &mut N
[src]
ⓘImportant traits for &'_ mut I
ⓘImportant traits for &'_ mut Ipub fn node_data(&self, idx: NodeIndex) -> &N
[src]
ⓘImportant traits for &'_ mut I
pub fn node(&self, idx: NodeIndex) -> &Node<N>
[src]
pub fn next_edge_index(&self) -> EdgeIndex
[src]
pub fn add_edge(
&mut self,
source: NodeIndex,
target: NodeIndex,
data: E
) -> EdgeIndex
[src]
&mut self,
source: NodeIndex,
target: NodeIndex,
data: E
) -> EdgeIndex
pub fn edge(&self, idx: EdgeIndex) -> &Edge<E>
[src]
pub fn enumerated_nodes(&self) -> impl Iterator<Item = (NodeIndex, &Node<N>)>
[src]
pub fn enumerated_edges(&self) -> impl Iterator<Item = (EdgeIndex, &Edge<E>)>
[src]
pub fn each_node<'a>(
&'a self,
f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool
[src]
&'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
[src]
&'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>pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>
[src]
ⓘImportant traits for AdjacentEdges<'g, N, E>
ⓘImportant traits for AdjacentEdges<'g, N, E>pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>
[src]
ⓘImportant traits for AdjacentEdges<'g, N, E>
ⓘImportant traits for AdjacentEdges<'g, N, E>pub fn adjacent_edges(
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<N, E>
[src]
ⓘImportant traits for AdjacentEdges<'g, N, E>
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<N, E>
pub fn successor_nodes<'a>(
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
[src]
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
pub fn predecessor_nodes<'a>(
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
[src]
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
ⓘImportant traits for DepthFirstTraversal<'g, N, E>pub fn depth_traverse<'a>(
&'a self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'a, N, E>
[src]
ⓘImportant traits for DepthFirstTraversal<'g, N, E>
&'a self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'a, N, E>
pub fn nodes_in_postorder(
&self,
direction: Direction,
entry_node: NodeIndex
) -> Vec<NodeIndex>
[src]
&self,
direction: Direction,
entry_node: NodeIndex
) -> Vec<NodeIndex>
Auto Trait Implementations
impl<N, E> Send for Graph<N, E> where
E: Send,
N: Send,
E: Send,
N: Send,
impl<N, E> Sync for Graph<N, E> where
E: Sync,
N: Sync,
E: Sync,
N: Sync,
Blanket Implementations
impl<T> Erased for T
[src]
impl<T> Send for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Sync for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From for T
[src]
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
ⓘImportant traits for &'_ mut Ifn borrow_mut(&mut self) -> &mut T
[src]
ⓘImportant traits for &'_ mut I
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.