Trait btree_graph::Edges

pub trait Edges<T> where
    T: Ord, {
    pub fn edges(&self) -> BTreeSet<&T>;
}

Edges returns the set edges which comprise the graph.

Example

use btree_graph::{BTreeGraph, AddVertex, AddEdge, Edges};
let mut graph: BTreeGraph<String, usize> = BTreeGraph::new();

assert_eq!(graph.edges().len(), 0);

Required methods

pub fn edges(&self) -> BTreeSet<&T>

Loading content...

Implementors

impl<V, E> Edges<E> for BTreeGraph<V, E> where
    V: Ord,
    E: Ord, 

pub fn edges(&self) -> BTreeSet<&E>

Loading content...