Skip to main content

TraverseEvent

fera_graph::traverse

Enum TraverseEvent 

Source 
pub enum TraverseEvent<G: WithEdge> {
    Start,
    Finish,
    DiscoverRootVertex(Vertex<G>),
    FinishRootVertex(Vertex<G>),
    DiscoverVertex(Vertex<G>),
    FinishVertex(Vertex<G>),
    DiscoverEdge(Edge<G>),
    FinishEdge(Edge<G>),
    DiscoverTreeEdge(Edge<G>),
    FinishTreeEdge(Edge<G>),
    DiscoverBackEdge(Edge<G>),
    DiscoverCrossOrForwardEdge(Edge<G>),
}

Variants§

§

Start

§

Finish

§

DiscoverRootVertex(Vertex<G>)

§

FinishRootVertex(Vertex<G>)

§

DiscoverVertex(Vertex<G>)

§

FinishVertex(Vertex<G>)

§

DiscoverEdge(Edge<G>)

§

FinishEdge(Edge<G>)

§

DiscoverTreeEdge(Edge<G>)

§

FinishTreeEdge(Edge<G>)

§

DiscoverBackEdge(Edge<G>)

§

DiscoverCrossOrForwardEdge(Edge<G>)

Trait Implementations§

Source§

impl<G: Clone + WithEdge> Clone for TraverseEvent<G>

Source§

fn clone(&self) -> TraverseEvent<G>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<G: Debug + WithEdge> Debug for TraverseEvent<G>

Source§

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

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

impl<G: PartialEq + WithEdge> PartialEq for TraverseEvent<G>

Source§

fn eq(&self, other: &TraverseEvent<G>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl<G: Copy + WithEdge> Copy for TraverseEvent<G>

Source§

impl<G: Eq + WithEdge> Eq for TraverseEvent<G>

Source§

impl<G: WithEdge> StructuralPartialEq for TraverseEvent<G>

Auto Trait Implementations§

§

impl<G> Freeze for TraverseEvent<G>
where <G as WithVertex>::Vertex: Freeze, <G as WithEdge>::Edge: Freeze,

§

impl<G> RefUnwindSafe for TraverseEvent<G>
where <G as WithVertex>::Vertex: RefUnwindSafe, <G as WithEdge>::Edge: RefUnwindSafe,

§

impl<G> Send for TraverseEvent<G>
where <G as WithVertex>::Vertex: Send, <G as WithEdge>::Edge: Send,

§

impl<G> Sync for TraverseEvent<G>
where <G as WithVertex>::Vertex: Sync, <G as WithEdge>::Edge: Sync,

§

impl<G> Unpin for TraverseEvent<G>
where <G as WithVertex>::Vertex: Unpin, <G as WithEdge>::Edge: Unpin,

§

impl<G> UnsafeUnpin for TraverseEvent<G>
where <G as WithVertex>::Vertex: UnsafeUnpin, <G as WithEdge>::Edge: UnsafeUnpin,

§

impl<G> UnwindSafe for TraverseEvent<G>
where <G as WithVertex>::Vertex: UnwindSafe, <G as WithEdge>::Edge: 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§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> IntoOwned<T> for T

Source§

fn into_owned(self) -> T

Source§

impl<G> Sets for G

Source§

fn vertices_complement<I>(&self, vertices: I) -> VerticesComplement<'_, Self> ⓘ
where Self: VertexList + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

fn edges_complement<I>(&self, edges: I) -> EdgesComplement<'_, Self> ⓘ
where Self: EdgeList + WithEdgeProp<bool>, I: IntoIterator, I::Item: IntoOwned<Edge<Self>>,

Source§

fn independent_vertex_set_from_iter<I>( &self, vertices: I, ) -> IndependentVertexSetFromIter<'_, Self, I::IntoIter> ⓘ
where Self: Adjacency + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

fn is_independent_vertex_set<I>(&self, vertices: I) -> bool
where Self: Adjacency + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

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

Source§

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>,

Source§

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>,

Source§

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.