pub struct Graph<N, E> {
    nodes: Vec<Node<N>>,
    edges: Vec<Edge<E>>,
}

Fields§

§nodes: Vec<Node<N>>§edges: Vec<Edge<E>>

Implementations§

source§

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

source

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

source

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

source

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

source

pub fn len_nodes(&self) -> usize

source

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

source

pub fn len_edges(&self) -> usize

source

pub fn next_node_index(&self) -> NodeIndex

source

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

source

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

source

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

source

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

source

pub fn next_edge_index(&self) -> EdgeIndex

source

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

source

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

source

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

source

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

source

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

Iterates over all edges defined in the graph.

source

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

Iterates over all edges defined in the graph

source

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

source

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

source

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

source

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

source

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

source

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

source

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

Auto Trait Implementations§

§

impl<N, E> RefUnwindSafe for Graph<N, E>where E: RefUnwindSafe, N: RefUnwindSafe,

§

impl<N, E> Send for Graph<N, E>where E: Send, N: Send,

§

impl<N, E> Sync for Graph<N, E>where E: Sync, N: Sync,

§

impl<N, E> Unpin for Graph<N, E>where E: Unpin, N: Unpin,

§

impl<N, E> UnwindSafe for Graph<N, E>where E: UnwindSafe, N: UnwindSafe,

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = const ALIGN: Alignment = Alignment::of::<Self>();

Alignment of Self.
source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'a, T> Captures<'a> for Twhere T: ?Sized,

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