Trait graphific::Algorithms[−][src]

pub trait Algorithms<K, V>: AnyGraph<K, V> + Kinship<K, V> where
    K: Key,
    V: Value, {
    fn bfs(&self) -> Option<Self> { ... }

    fn bfs_with_starting_vertex(
        &self, 
        starting_vertex: &Vertex<K, V>
    ) -> Option<Self> { ... }

    fn dfs(&self) -> Option<Self> { ... }

    fn dfs_with_starting_vertex(
        &self, 
        starting_vertex: &Vertex<K, V>
    ) -> Option<Self> { ... }
}

An interface describing all the algorithms that can be used on any kind of graphs.

Provided methods

fn bfs(&self) -> Option<Self>[src]

Execute a Broad Search First the return the discovered graph. There is no order in which the edges are treated.

fn bfs_with_starting_vertex(
    &self,
    starting_vertex: &Vertex<K, V>
) -> Option<Self>[src]

Execute a Broad Search First with a starting vertex the return the discovered graph. There is no order in which the edges are treated.

fn dfs(&self) -> Option<Self>[src]

Execute a Deep Search First the return the discovered graph. There is no order in which the edges are treated.

fn dfs_with_starting_vertex(
    &self,
    starting_vertex: &Vertex<K, V>
) -> Option<Self>[src]

Execute a Deep Search First with a starting vertex the return the discovered graph. There is no order in which the edges are treated.

Loading content...

Implementors

impl<K, V> Algorithms<K, V> for BasicDirectedGraph<K, V> where
    K: Key,
    V: Value, [src]

impl<K, V> Algorithms<K, V> for BasicUndirectedGraph<K, V> where
    K: Key,
    V: Value, [src]

Loading content...