/
bfs.rs
60 lines (48 loc) · 1.66 KB
/
bfs.rs
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
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
use std::collections::VecDeque;
impl Solution {
pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
let mut result = 0;
let mut visited = vec![false; is_connected.len()];
let mut queue = VecDeque::new();
for mut node in 0..is_connected.len() {
if let v @ false = &mut visited[node] {
*v = true;
result += 1;
loop {
for next in
is_connected[node]
.iter()
.enumerate()
.filter_map(|(i, &connected)| if connected == 0 { None } else { Some(i) })
{
if let v @ false = &mut visited[next] {
*v = true;
queue.push_back(next);
}
}
if let Some(next_node) = queue.pop_front() {
node = next_node;
} else {
break;
}
}
}
}
result
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
Self::find_circle_num(is_connected)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}