Struct FindCutEdges

Source

pub struct FindCutEdges<G: Graph> { /* private fields */ }

Trait Implementations§

Source §

fn discover_cross_or_forward_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

Auto Trait Implementations§

§

impl<G> Freeze for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Freeze,

§

impl<G> RefUnwindSafe for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: RefUnwindSafe, <G as WithEdge>::Edge: RefUnwindSafe,

§

impl<G> Send for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Send, <G as WithEdge>::Edge: Send,

§

impl<G> Sync for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Sync, <G as WithEdge>::Edge: Sync,

§

impl<G> Unpin for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Unpin, <G as WithEdge>::Edge: Unpin,

§

impl<G> UnwindSafe for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: 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> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into 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(&self, vertices: I) -> VerticesComplement<'_, Self> ⓘ
where Self: VertexList + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source §

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

Source §

fn independent_vertex_set_from_iter( &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(&self, vertices: I) -> bool
where Self: Adjacency + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source §

impl<T, U> TryFrom 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>::Error>

Performs the conversion.

Source §

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

Source §

type Error = >::Error

The type returned in the event of a conversion error.

Source §

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

Performs the conversion.

FindCutEdges

Struct FindCutEdges Copy item path

Trait Implementations§

impl<G: Graph> Visitor<G> for FindCutEdges<G>

fn discover_vertex(&mut self, _g: &G, v: Vertex<G>) -> Control

fn discover_back_edge(&mut self, g: &G, e: Edge<G>) -> Control

fn finish_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control

fn start(&mut self, _g: &G) -> Control

fn finish(&mut self, _g: &G) -> Control

fn discover_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn discover_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn finish_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_tree_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_cross_or_forward_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

Auto Trait Implementations§

impl<G> Freeze for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: Freeze,

impl<G> RefUnwindSafe for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: RefUnwindSafe, <G as WithEdge>::Edge: RefUnwindSafe,

impl<G> Send for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: Send, <G as WithEdge>::Edge: Send,

impl<G> Sync for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: Sync, <G as WithEdge>::Edge: Sync,

impl<G> Unpin for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: Unpin, <G as WithEdge>::Edge: Unpin,

impl<G> UnwindSafe for FindCutEdges<G>where <G as WithVertexProp<u64>>::VertexProp: UnwindSafe, <G as WithEdge>::Edge: UnwindSafe,

Blanket Implementations§

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> IntoOwned<T> for T

fn into_owned(self) -> T

impl<G> Sets for G

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

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

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

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

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

type Error = Infallible

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

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

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

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

Struct FindCutEdges

impl<G> Freeze for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Freeze,

impl<G> RefUnwindSafe for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: RefUnwindSafe, <G as WithEdge>::Edge: RefUnwindSafe,

impl<G> Send for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Send, <G as WithEdge>::Edge: Send,

impl<G> Sync for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Sync, <G as WithEdge>::Edge: Sync,

impl<G> Unpin for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: Unpin, <G as WithEdge>::Edge: Unpin,

impl<G> UnwindSafe for FindCutEdges<G>
where <G as WithVertexProp<u64>>::VertexProp: UnwindSafe, <G as WithEdge>::Edge: UnwindSafe,

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

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

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

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

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

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

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

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

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

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