Struct petgraph::visit::Dfs

source ·
pub struct Dfs<N, VM> {
    pub stack: Vec<N>,
    pub discovered: VM,
}
Expand description

Visit nodes of a graph in a depth-first-search (DFS) emitting nodes in preorder (when they are first discovered).

The traversal starts at a given node and only traverses nodes reachable from it.

Dfs is not recursive.

Dfs does not itself borrow the graph, and because of this you can run a traversal over a graph while still retaining mutable access to it, if you use it like the following example:

use petgraph::Graph;
use petgraph::visit::Dfs;

let mut graph = Graph::<_,()>::new();
let a = graph.add_node(0);

let mut dfs = Dfs::new(&graph, a);
while let Some(nx) = dfs.next(&graph) {
    // we can access `graph` mutably here still
    graph[nx] += 1;
}

assert_eq!(graph[a], 1);

Note: The algorithm may not behave correctly if nodes are removed during iteration. It may not necessarily visit added nodes or edges.

Fields§

§stack: Vec<N>

The stack of nodes to visit

§discovered: VM

The map of discovered nodes

Implementations§

source§

impl<N, VM> Dfs<N, VM>
where N: Copy + PartialEq, VM: VisitMap<N>,

source

pub fn new<G>(graph: G, start: N) -> Self
where G: GraphRef + Visitable<NodeId = N, Map = VM>,

Create a new Dfs, using the graph’s visitor map, and put start in the stack of nodes to visit.

source

pub fn from_parts(stack: Vec<N>, discovered: VM) -> Self

Create a Dfs from a vector and a visit map

source

pub fn reset<G>(&mut self, graph: G)
where G: GraphRef + Visitable<NodeId = N, Map = VM>,

Clear the visit state

source

pub fn empty<G>(graph: G) -> Self
where G: GraphRef + Visitable<NodeId = N, Map = VM>,

Create a new Dfs using the graph’s visitor map, and no stack.

source

pub fn move_to(&mut self, start: N)

Keep the discovered map, but clear the visit stack and restart the dfs from a particular node.

source

pub fn next<G>(&mut self, graph: G) -> Option<N>
where G: IntoNeighbors<NodeId = N>,

Return the next node in the dfs, or None if the traversal is done.

Trait Implementations§

source§

impl<N: Clone, VM: Clone> Clone for Dfs<N, VM>

source§

fn clone(&self) -> Dfs<N, VM>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<N: Debug, VM: Debug> Debug for Dfs<N, VM>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<N, VM> Default for Dfs<N, VM>
where VM: Default,

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<G> Walker<G> for Dfs<G::NodeId, G::Map>

§

type Item = <G as GraphBase>::NodeId

source§

fn walk_next(&mut self, context: G) -> Option<Self::Item>

Advance to the next item
source§

fn iter(self, context: Context) -> WalkerIter<Self, Context>
where Self: Sized, Context: Clone,

Create an iterator out of the walker and given context.

Auto Trait Implementations§

§

impl<N, VM> Freeze for Dfs<N, VM>
where VM: Freeze,

§

impl<N, VM> RefUnwindSafe for Dfs<N, VM>

§

impl<N, VM> Send for Dfs<N, VM>
where VM: Send, N: Send,

§

impl<N, VM> Sync for Dfs<N, VM>
where VM: Sync, N: Sync,

§

impl<N, VM> Unpin for Dfs<N, VM>
where VM: Unpin, N: Unpin,

§

impl<N, VM> UnwindSafe for Dfs<N, VM>
where VM: UnwindSafe, N: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. 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 T
where 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> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where 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 T
where 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.