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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184

use std::{collections::{HashMap, HashSet}, hash::Hash};

use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct DirectedGraph<Vertex: Eq + Hash + Clone, Edge: Eq + Hash> {
    vertices: HashMap<Vertex, usize>,
    idxs: HashMap<usize, Vertex>,

    connections: HashMap<usize, HashSet<(usize, Edge)>>
}

impl<Vertex: Eq + Hash + Clone, Edge: Eq + Hash> DirectedGraph<Vertex, Edge> {
    pub fn new() -> Self {
        DirectedGraph { 
            vertices: HashMap::new(), 
            idxs: HashMap::new(), 
            connections: HashMap::new() 
        }
    }

    pub fn contains(&self, v: &Vertex) -> bool {
        self.vertices.contains_key(v)
    }

    fn vertex_by_idx(&self, idx: usize) -> &Vertex {
        return self.idxs.get(&idx).unwrap();
    }

    fn vertex_idx_unchecked(&self, v: &Vertex) -> usize {
        return *self.vertices.get(v).unwrap();
    }

    fn vertex_idx(&mut self, v: Vertex) -> usize {
        if let Some(idx) = self.vertices.get(&v) {
            *idx

        } else {
            let idx = self.vertices.len();
            self.vertices.insert(v.clone(), idx);
            self.idxs.insert(idx, v);

            idx
        }
    }

    pub fn connections(&self, v: &Vertex) -> Result<HashSet<(&Vertex, &Edge)>, String> {
        if self.contains(v) {
            let idx = self.vertex_idx_unchecked(v);

            if let Some(conn) = self.connections.get(&idx) {
                return Ok(conn.iter().map(|(k, v)| (self.vertex_by_idx(*k), v)).collect());
            }
        }
        
        Err("Vertex is not in the graph".into())
    }

    pub fn connect(&mut self, from: Vertex, to: Vertex, edge: Edge) {
        let idx_from = self.vertex_idx(from);
        let idx_to = self.vertex_idx(to);

        self.connections.entry(idx_from).or_default().insert((idx_to, edge));
    }

    pub fn dfs<F: FnMut(&Vertex)>(&self, start: &Vertex, mut op: F) {
        if self.vertices.contains_key(start) {
            let mut seen: HashSet<usize> = HashSet::new();
            let mut stack = vec!(self.vertex_idx_unchecked(start));
    
            while let Some(elem) = stack.pop() {
                
                seen.insert(elem);
    
                op(self.vertex_by_idx(elem));
    
                if self.connections.contains_key(&elem) {
                    for (i, _) in self.connections.get(&elem).unwrap() {
                        if !seen.contains(i) {
                            stack.push(*i);
                        }
                    }
                }
            }
        }
    }

    pub fn bfs<F: FnMut(&Vertex)>(&self, start: &Vertex, mut op: F) {
        if self.vertices.contains_key(start) {
            let mut seen: HashSet<usize> = HashSet::new();
            let mut layer = vec!(self.vertex_idx_unchecked(start));

            while !layer.is_empty() {
                let mut new_layer = vec!();
                
                for elem in &layer {
                    seen.insert(*elem);
                    op(self.vertex_by_idx(*elem));

                    if self.connections.contains_key(elem) {
                        for (i, _) in self.connections.get(elem).unwrap() {
                            if !seen.contains(i) {
                                new_layer.push(*i);
                            }
                        }
                    }
                }

                layer = new_layer;
            }
        }
    }

    pub fn to_dot<F: Fn(&Vertex) -> String>(&self, repr: F) -> String {
        let mut lines = vec!();

        for (from, dest) in &self.connections {
            let rf = repr(self.vertex_by_idx(*from));
            for (to, _) in dest {
                let rt = repr(self.vertex_by_idx(*to));
                lines.push(format!("\"{}\" -> \"{}\"", rf, rt));
            }
        }

        format!("digraph G {{\n{}\n}}", lines.join("\n"))
    }
}

#[cfg(test)]
mod tests {
    use std::collections::HashSet;

    use super::DirectedGraph;

    #[test]
    fn graph_construction() {
        let mut g = DirectedGraph::new();

        g.connect("A", "B", 1);
        g.connect("A", "C", 2);
        g.connect("A", "D", 3);

        g.connect("B", "C", 2);
        g.connect("B", "D", 2);
        g.connect("B", "C", 3);

        g.connect("D", "D", 4);

        assert!(g.contains(&"A"));
        assert!(g.contains(&"B"));
        assert!(g.contains(&"C"));
        assert!(g.contains(&"D"));
        assert!(!g.contains(&"E"));

        assert_eq!(
            g.connections(&"A"),
            Ok([(&"B", &1), (&"C", &2), (&"D", &3)].iter().cloned().collect())
        );

        assert_eq!(
            g.connections(&"B"),
            Ok([(&"C", &2), (&"D", &2), (&"C", &3)].iter().cloned().collect())
        );

        assert!(g.connections(&"C").is_err());

        assert_eq!(
            g.connections(&"D"),
            Ok([(&"D", &4)].iter().cloned().collect())
        );

        let mut dfs_nodes = HashSet::new();
        g.dfs(&"A", |i| { dfs_nodes.insert(*i); });

        assert_eq!(dfs_nodes.len(), 4);

        let mut bfs_nodes = HashSet::new();
        g.bfs(&"A", |i| { bfs_nodes.insert(*i); });

        assert_eq!(bfs_nodes.len(), 4);

        assert_eq!(g.to_dot(|i| i.to_string()).len(), 90);
    }
}