Struct generic_graph::SimpleVertex

pub struct SimpleVertex<K: Hash + Eq + Clone, V> { /* fields omitted */ }

A default implementation for vertexes. This implementation should be suitable for most of the problem one can encounter requiring graph.

Contrary to other graph implementation this library does not expect the vertexes to store if they have been visited, or if they were marked. The reason for this is that the author believes such an information should be stored in a structure extern and independent to the graph, this to ensure consistency between threads and to allow different algorithms to use different structures according to their needs

methods are self explanatory

Methods

impl<K: Hash + Eq + Clone, V> SimpleVertex<K, V>

pub fn new(key: K, value: V) -> SimpleVertex<K, V>

Trait Implementations

impl<K: Debug + Hash + Eq + Clone, V: Debug> Debug for SimpleVertex<K, V>

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

Formats the value using the given formatter.

impl<K: Hash + Eq + Clone, V, W: Sum + Sub + Eq + Ord + Copy> DirectedGraph<SimpleVertex<K, V>, DirectedEdge<K, W>, K, V, W, CompoundKey<K>> for AdjacencyGraph<K, V, W>

fn adjacent(&self, from: &K, to: &K) -> bool

This method returns a boolean stating if exist an edge from the first vertex to the other

fn neighbors(&self, from: &K) -> Vec<&K>

This method returns a vector containing the keys of all the vertexes reached by edges starting from the argument

fn leading_to(&self, to: &K) -> Vec<&K>

This method returns a vector containing the keys of all the vertexes with by edges leading to the argument

fn get_vertex(&self, key: &K) -> Option<&SimpleVertex<K, V>>

fn get_mutable_vertex(&mut self, key: &K) -> Option<&mut SimpleVertex<K, V>>

fn get_edge(&self, pair: (&K, &K)) -> Option<&DirectedEdge<K, W>>

fn get_mutable_edge(
    &mut self,
    pair: (&K, &K)
) -> Option<&mut DirectedEdge<K, W>>

impl<K: Eq + Hash + Clone, V: Eq> Eq for SimpleVertex<K, V>

impl<K: PartialEq + Hash + Eq + Clone, V: PartialEq> PartialEq<SimpleVertex<K, V>> for SimpleVertex<K, V>

fn eq(&self, other: &SimpleVertex<K, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &SimpleVertex<K, V>) -> bool

This method tests for !=.

impl<K: Hash + Eq + Clone, V> StructuralEq for SimpleVertex<K, V>

impl<K: Hash + Eq + Clone, V> StructuralPartialEq for SimpleVertex<K, V>

impl<K: Hash + Eq + Clone, V> Vertex<K, V> for SimpleVertex<K, V>

fn get_value(&self) -> &V

fn get_mutable(&mut self) -> &mut V

fn key(&self) -> K