ConnectedComponents

fera_graph::algs::components

Struct ConnectedComponents 

Source 
pub struct ConnectedComponents<G, V> { /* private fields */ }

Implementations§

Source§

impl<G, V> ConnectedComponents<G, V>
where G: WithEdge, V: VertexPropMut<G, usize>,

Source

pub fn is_connected(&self, u: Vertex<G>, v: Vertex<G>) -> bool

Source

pub fn is_disconnected(&self, u: Vertex<G>, v: Vertex<G>) -> bool

Source

pub fn component(&self, v: Vertex<G>) -> usize

Source

pub fn num_components(&self) -> usize

Trait Implementations§

Source§

impl<G, V> Visitor<G> for ConnectedComponents<G, V>
where G: WithEdge, V: VertexPropMut<G, usize>,

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Auto Trait Implementations§

§

impl<G, V> Freeze for ConnectedComponents<G, V>
where V: Freeze,

§

impl<G, V> RefUnwindSafe for ConnectedComponents<G, V>
where V: RefUnwindSafe, G: RefUnwindSafe,

§

impl<G, V> Send for ConnectedComponents<G, V>
where V: Send, G: Send,

§

impl<G, V> Sync for ConnectedComponents<G, V>
where V: Sync, G: Sync,

§

impl<G, V> Unpin for ConnectedComponents<G, V>
where V: Unpin, G: Unpin,

§

impl<G, V> UnwindSafe for ConnectedComponents<G, V>
where V: UnwindSafe, G: 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<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, 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.