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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

//==== Includes ===============================================================

use std::{fmt::Display, hash::Hash};

use ahash::HashSet;

use super::method::*;
use super::*;

//==== Ordering ===============================================================

pub enum Ordering {
    Pre,
    Post,
}

pub struct Order<'a, K, N, E>
where
    K: Clone + Hash + Display + PartialEq + Eq,
    N: Clone,
    E: Clone,
{
    root: &'a Node<K, N, E>,
    method: Method<'a, K, N, E>,
    order: Ordering,
}

impl<'a, K, N, E> Order<'a, K, N, E>
where
    K: Clone + Hash + Display + PartialEq + Eq,
    N: Clone,
    E: Clone,
{
    pub fn new(root: &'a Node<K, N, E>) -> Self {
        Self {
            root,
            method: Method::Empty,
            order: Ordering::Pre,
        }
    }

    pub fn pre(mut self) -> Self {
        self.order = Ordering::Pre;
        self
    }

    pub fn post(mut self) -> Self {
        self.order = Ordering::Post;
        self
    }

    pub fn for_each(mut self, f: ForEach<'a, K, N, E>) -> Self {
        self.method = Method::ForEach(f);
        self
    }

    pub fn filter(mut self, f: Filter<'a, K, N, E>) -> Self {
        self.method = Method::Filter(f);
        self
    }

    pub fn search_nodes(&mut self) -> Vec<Node<K, N, E>> {
        let mut nodes = vec![];
        let mut edges = vec![];
        let mut queue = vec![];
        let mut visited = HashSet::default();

        queue.push(self.root.clone());
        visited.insert(self.root.key().clone());

        match self.order {
            Ordering::Pre => {
                self.recurse_preorder(&mut edges, &mut visited, &mut queue);
                nodes.push(self.root.clone());
                let mut coll = edges.iter().map(|Edge(_, v, _)| v.clone()).collect();
                nodes.append(&mut coll);
            }
            Ordering::Post => {
                self.recurse_postorder(&mut edges, &mut visited, &mut queue);
                let mut coll = edges.iter().map(|Edge(_, v, _)| v.clone()).collect();
                nodes.append(&mut coll);
                nodes.push(self.root.clone());
            }
        }
        nodes
    }

    pub fn search_edges(&mut self) -> Vec<Edge<K, N, E>> {
        let mut edges = vec![];
        let mut queue = vec![];
        let mut visited = HashSet::default();

        queue.push(self.root.clone());
        visited.insert(self.root.key().clone());

        match self.order {
            Ordering::Pre => {
                self.recurse_preorder(&mut edges, &mut visited, &mut queue);
            }
            Ordering::Post => {
                self.recurse_postorder(&mut edges, &mut visited, &mut queue);
            }
        }
        edges
    }

    fn recurse_preorder(
        &mut self,
        result: &mut Vec<Edge<K, N, E>>,
        visited: &mut HashSet<K>,
        queue: &mut Vec<Node<K, N, E>>,
    ) -> bool {
        if let Some(node) = queue.pop() {
            for edge in node.iter() {
                let edge = edge.reverse();
                let v = edge.1.clone();
                if self.method.exec(&edge) && !visited.contains(v.key()) {
                    visited.insert(v.key().clone());
                    queue.push(v.clone());
                    self.recurse_preorder(result, visited, queue);
                    result.push(edge);
                }
            }
        }
        false
    }

    fn recurse_postorder(
        &mut self,
        result: &mut Vec<Edge<K, N, E>>,
        visited: &mut HashSet<K>,
        queue: &mut Vec<Node<K, N, E>>,
    ) -> bool {
        if let Some(node) = queue.pop() {
            for edge in node.iter() {
                let v = edge.1.clone();
                if self.method.exec(&edge) && !visited.contains(v.key()) {
                    visited.insert(v.key().clone());
                    queue.push(v.clone());
                    self.recurse_postorder(result, visited, queue);
                    result.push(edge);
                }
            }
        }
        false
    }
}