cpd 0.3.2

Collaboration Pattern Detection: A tool to search for context-aware and relaxed frequent subgraphs (patterns) in a graph database
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

use crate::data::edge::Edge;

#[derive(Debug, Clone)]
pub struct Vertex {
    pub id: usize,
    pub label: usize,
    pub vertex_type: usize,
    pub edges: Vec<Edge>,
}

impl Vertex {
    pub fn new(id: usize, label: Option<usize>, v_type: Option<usize>) -> Vertex {
        Vertex {
            id,
            label: label.unwrap_or_default(),
            vertex_type: v_type.unwrap_or(0),
            edges: Vec::with_capacity(8),
        }
    }

    pub fn push(&mut self, to: usize, e_label: usize) {
        self.edges.push(Edge::new(self.id, to, e_label));
    }

    pub fn to_str_repr(&self) -> String {
        [
            "v".to_string(),
            self.id.to_string(),
            self.label.to_string(),
            self.vertex_type.to_string(),
        ]
        .join(" ")
    }
}

impl PartialEq for Vertex {
    fn eq(&self, other: &Self) -> bool {
        self.label == other.label && self.vertex_type == other.vertex_type
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_create_vertex() {
        let v1 = Vertex::new(1, None, None);
        assert_eq!(v1.id, 1);
    }

    #[test]
    fn test_add_edge() {
        let mut v1 = Vertex::new(1, Some(2), Some(3));
        assert_eq!(v1.edges.len(), 0);
        assert_eq!(v1.label, 2);
        assert_eq!(v1.vertex_type, 3);
        v1.push(2, 2);
        assert_eq!(v1.edges.len(), 1);
        let e = v1.edges.pop().unwrap();
        assert_eq!(v1.edges.len(), 0);
        assert_eq!(e.to, 2);
        assert_eq!(e.from, 1);
        assert_eq!(e.e_label, 2);
    }
}