raphtory 0.17.0

raphtory, a temporal graph library
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
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

use raphtory::{prelude::*, test_storage, test_utils::test_graph};

#[test]
fn test_exploded_edge_properties() {
    let graph = Graph::new();
    let actual_prop_values = vec![0, 1, 2, 3];
    for v in actual_prop_values.iter() {
        graph.add_edge(0, 1, 2, [("test", *v)], None).unwrap();
    }

    test_storage!(&graph, |graph| {
        let prop_values: Vec<_> = graph
            .edge(1, 2)
            .unwrap()
            .explode()
            .properties()
            .flat_map(|p| p.get("test").into_i32())
            .collect();
        assert_eq!(prop_values, actual_prop_values)
    });
}

#[test]
fn test_exploded_edge_properties_window() {
    let graph = Graph::new();
    let actual_prop_values_0 = vec![0, 1, 2, 3];
    for v in actual_prop_values_0.iter() {
        graph.add_edge(0, 1, 2, [("test", *v)], None).unwrap();
    }
    let actual_prop_values_1 = vec![4, 5, 6];
    for v in actual_prop_values_1.iter() {
        graph.add_edge(1, 1, 2, [("test", *v)], None).unwrap();
    }
    test_storage!(&graph, |graph| {
        let prop_values: Vec<_> = graph
            .at(0)
            .edge(1, 2)
            .unwrap()
            .explode()
            .properties()
            .flat_map(|p| p.get("test").into_i32())
            .collect();
        assert_eq!(prop_values, actual_prop_values_0);
        let prop_values: Vec<_> = graph
            .at(1)
            .edge(1, 2)
            .unwrap()
            .explode()
            .properties()
            .flat_map(|p| p.get("test").into_i32())
            .collect();
        assert_eq!(prop_values, actual_prop_values_1)
    });
}

#[test]
fn test_exploded_edge_multilayer() {
    let graph = Graph::new();
    let expected_prop_values = vec![0, 1, 2, 3];
    for v in expected_prop_values.iter() {
        graph
            .add_edge(0, 1, 2, [("test", *v)], Some((v % 2).to_string().as_str()))
            .unwrap();
    }
    // FIXME: Needs support for event id from EventTime in disk storage (Issue #30)
    test_graph(&graph, |graph| {
        let prop_values: Vec<_> = graph
            .edge(1, 2)
            .unwrap()
            .explode()
            .properties()
            .flat_map(|p| p.get("test").into_i32())
            .collect();
        let actual_layers: Vec<_> = graph
            .edge(1, 2)
            .unwrap()
            .explode()
            .layer_name()
            .flatten()
            .collect();
        let expected_layers: Vec<_> = expected_prop_values
            .iter()
            .map(|v| (v % 2).to_string())
            .collect();
        assert_eq!(prop_values, expected_prop_values);
        assert_eq!(actual_layers, expected_layers);

        assert!(graph.edge(1, 2).unwrap().layer_name().is_err());
        assert!(graph.edges().layer_name().all(|l| l.is_err()));
        assert!(graph
            .edge(1, 2)
            .unwrap()
            .explode()
            .layer_name()
            .all(|l| l.is_ok()));
        assert!(graph
            .edge(1, 2)
            .unwrap()
            .explode_layers()
            .layer_name()
            .all(|l| l.is_ok()));
        assert!(graph.edges().explode().layer_name().all(|l| l.is_ok()));
        assert!(graph
            .edges()
            .explode_layers()
            .layer_name()
            .all(|l| l.is_ok()));

        assert!(graph.edge(1, 2).unwrap().time().is_err());
        assert!(graph.edges().time().all(|l| l.is_err()));
        assert!(graph
            .edge(1, 2)
            .unwrap()
            .explode()
            .time()
            .all(|l| l.is_ok()));
        assert!(graph
            .edge(1, 2)
            .unwrap()
            .explode_layers()
            .time()
            .all(|l| l.is_err()));
        assert!(graph.edges().explode().time().all(|l| l.is_ok()));
        assert!(graph.edges().explode_layers().time().all(|l| l.is_err()));
    });
}

#[test]
fn test_sorting_by_event_id() {
    let graph = Graph::new();
    graph.add_edge(0, 2, 3, NO_PROPS, None).unwrap();
    graph.add_edge(0, 1, 2, NO_PROPS, None).unwrap();
    graph.add_edge(0, 1, 2, [("second", true)], None).unwrap();
    graph.add_edge(0, 2, 3, [("second", true)], None).unwrap();

    //FIXME: DiskGraph does not preserve event id (see #1780)
    test_graph(&graph, |graph| {
        let mut exploded_edges: Vec<_> = graph.edges().explode().into_iter().collect();
        exploded_edges.sort_by_key(|a| a.time_and_event_id().unwrap());

        let res: Vec<_> = exploded_edges
            .into_iter()
            .filter_map(|e| {
                Some((
                    e.src().id().as_u64()?,
                    e.dst().id().as_u64()?,
                    e.properties().get("second").into_bool(),
                ))
            })
            .collect();
        assert_eq!(
            res,
            vec![
                (2, 3, None),
                (1, 2, None),
                (1, 2, Some(true)),
                (2, 3, Some(true))
            ]
        )
    });
}