Trait graphific::Kinship[−][src]

pub trait Kinship<K, V>: AnyGraph<K, V> where
    K: Key,
    V: Value, {
    fn successors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>>;

    fn predecessors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>>;

    fn successors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>> { ... }

    fn predecessors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>> { ... }

    fn key_vertex_map(&self) -> HashMap<K, Vertex<K, V>> { ... }
}

An interface for getting the successors and predecessors of each Vertex.

Required methods

fn successors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>>[src]

Get the successors of each vertex.

fn predecessors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>>[src]

Get the predecessors of each vertex.

Loading content...

Provided methods

fn successors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>>[src]

Get the successors of each vertex where the key is a Key.

fn predecessors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>>[src]

Get the predecessors of each vertex where the key is a Key.

fn key_vertex_map(&self) -> HashMap<K, Vertex<K, V>>[src]

Get the map of key and vertex.

Loading content...

Implementors

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

fn successors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>[src]

Get the successors of each vertex. Complexity: O(V + E).

fn predecessors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>[src]

Get the predecessors of each vertex. Complexity: O(V + E).

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

fn successors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>[src]

Get the successors of each vertex. Complexity: O(V + E).

fn predecessors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>[src]

Get the predecessors of each vertex. Complexity: O(V + E).

Loading content...