dsalgo 0.3.10

A package for Datastructures and Algorithms.
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

//! add a pattern of labels to nodes in the bipartite graph (true/false)
//! if the given graph is not bipartite, return None

/// given graph must be bidirected.

pub fn label_bipartite(g: &[Vec<usize>]) -> Option<Vec<bool>> {
    let n = g.len();

    let mut label = vec![false; n];

    let mut que = std::collections::VecDeque::new();

    let mut labeled = vec![false; n];

    for i in 0..n {
        if labeled[i] {
            continue;
        }

        labeled[i] = true;

        que.push_back(i);

        while let Some(u) = que.pop_front() {
            for &v in g[u].iter() {
                if !labeled[v] {
                    label[v] = label[u] ^ true;

                    labeled[v] = true;
                } else if label[v] == label[u] {
                    return None;
                }
            }
        }
    }

    debug_assert!(labeled.into_iter().fold(true, |x, y| x && y));

    Some(label)
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        // TODO:
    }
}