(&mut self, v: usize, w: usize)
| 56 | } |
| 57 | |
| 58 | fn add_edge(&mut self, v: usize, w: usize) { |
| 59 | // Algorithhms 4th Edition by Robert Sedgewick, Kevin Wayne |
| 60 | // p538, Adjacency-lists data structure |
| 61 | // first adjacent vertex in input is last on list |
| 62 | self.adj[v].push_front(w); |
| 63 | self.adj[w].push_front(v); |
| 64 | self.ne += 1; |
| 65 | } |
| 66 | |
| 67 | fn adj(&self, v: usize) -> Iter<'_, usize> { |
| 68 | self.adj[v].iter() |
no test coverage detected