Type Alias DiGraphMap

pub type DiGraphMap<N, E> = GraphMap<N, E, Directed>;

A GraphMap with directed edges.

For example, an edge from 1 to 2 is distinct from an edge from 2 to 1.

Aliased Type

pub struct DiGraphMap<N, E> { /* private fields */ }

Trait Implementations

impl KeySearch for DiGraphMap<Key, Edge>

Implementation of KeySearch for the graph used to hold keys

fn find_key(&self, v: char) -> Option<Key>

Finds the key given a char from it. Returns Some(Key) if a key exists else returns None.