[−][src]Struct easy_graph::connected_graph::ConnectedGraph

pub struct ConnectedGraph<T: Eq + Hash>(_);

Methods

impl<T: Eq + Hash + Clone> ConnectedGraph<T>[src]

pub fn take_connected_part(graph: &mut Graph<T>, vertex: &T) -> Self[src]

Creates ConnectedGraph<T> from basic Graph<T> by taking it's connected part, that contains vertex.

pub fn split_graph(graph: Graph<T>) -> Vec<Self>[src]

Converts basic Graph<T> into vector of ConnectedGraph<T> with splitting it into connected parts.

pub fn into_graph(self) -> Graph<T>[src]

Converts self into Graph<T>

pub fn graph(&self) -> &Graph<T>[src]

Return immutable reference to underlying graph

pub fn add_edge(&mut self, v1: &T, v2: &T) -> bool[src]

Adds edge to graph. This operation can't make graph not connected.

pub fn remove_single_connected(&mut self)[src]

Removes all vertices with single connection. After that operation, all left vertices will have at least two connections.

Auto Trait Implementations

impl<T> RefUnwindSafe for ConnectedGraph<T> where
    T: RefUnwindSafe, 

impl<T> Send for ConnectedGraph<T> where
    T: Send, 

impl<T> Sync for ConnectedGraph<T> where
    T: Sync, 

impl<T> Unpin for ConnectedGraph<T> where
    T: Unpin, 

impl<T> UnwindSafe for ConnectedGraph<T> where
    T: UnwindSafe, 

Blanket Implementations

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

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

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

The type returned in the event of a conversion error.