gdsl 0.2.1

GDSL is a graph data-structure library including graph containers, connected node strutures and efficient algorithms on those structures. Nodes are independent of a graph container and can be used as connected smart pointers.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

use super::*;

pub type Filter<'a, K, N, E> = &'a mut dyn FnMut(&Edge<K, N, E>) -> bool;
pub type ForEach<'a, K, N, E> = &'a mut dyn FnMut(&Edge<K, N, E>);

pub enum Method<'a, K, N, E>
where
    K: Clone + Hash + Display + PartialEq + Eq,
    N: Clone,
    E: Clone,
{
    Empty,
    Filter(Filter<'a, K, N, E>),
    ForEach(ForEach<'a, K, N, E>),
}

impl<'a, K, N, E> Method<'a, K, N, E>
where
    K: Clone + Hash + Display + PartialEq + Eq,
    N: Clone,
    E: Clone,
{
    pub fn exec(&mut self, e: &Edge<K, N, E>) -> bool {
        match self {
            Method::Empty => true,
            Method::Filter(f) => f(e),
            Method::ForEach(f) => {
                f(e);
                true
            }
        }
    }
}