graphannis-core 4.1.2

This crate supports graph representation and generic query-functionality.
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

use super::*;
use crate::{graph::NODE_TYPE_KEY, types::Annotation, util::example_graphs::create_linear_gs};

#[test]
fn find_connections_dense() {
    let orig = create_linear_gs().unwrap();
    let mut gs = DenseAdjacencyListStorage::new();
    let mut node_annos = AnnoStorageImpl::new();
    for i in 0..=10 {
        node_annos
            .insert(
                i,
                Annotation {
                    key: NODE_TYPE_KEY.as_ref().clone(),
                    val: "node".into(),
                },
            )
            .unwrap();
    }
    gs.copy(&node_annos, &orig).unwrap();

    let found: Result<Vec<NodeID>> = gs.find_connected(0, 2, Bound::Included(3)).collect();
    let mut found = found.unwrap();
    found.sort();
    assert_eq!(vec![2, 3], found);
    assert_eq!(true, gs.is_connected(0, 2, 2, Bound::Included(3)).unwrap());
    assert_eq!(true, gs.is_connected(0, 3, 2, Bound::Included(3)).unwrap());
    assert_eq!(false, gs.is_connected(0, 4, 2, Bound::Included(3)).unwrap());
    assert_eq!(false, gs.is_connected(0, 8, 2, Bound::Included(3)).unwrap());

    let found: Result<Vec<NodeID>> = gs.find_connected(5, 1, Bound::Excluded(3)).collect();
    let mut found = found.unwrap();
    found.sort();
    assert_eq!(vec![6, 7], found);
    assert_eq!(true, gs.is_connected(5, 6, 1, Bound::Excluded(3)).unwrap());
    assert_eq!(true, gs.is_connected(5, 7, 1, Bound::Excluded(3)).unwrap());
    assert_eq!(false, gs.is_connected(5, 8, 1, Bound::Excluded(3)).unwrap());

    let found: Result<Vec<NodeID>> = gs
        .find_connected(0, 2, std::ops::Bound::Unbounded)
        .collect();
    let mut found = found.unwrap();
    found.sort();
    assert_eq!(vec![2, 3, 4], found);
    assert_eq!(true, gs.is_connected(0, 2, 2, Bound::Unbounded).unwrap());
    assert_eq!(true, gs.is_connected(0, 3, 2, Bound::Unbounded).unwrap());
    assert_eq!(true, gs.is_connected(0, 4, 2, Bound::Unbounded).unwrap());
    assert_eq!(false, gs.is_connected(0, 8, 2, Bound::Unbounded).unwrap());
}

#[test]
fn find_connections_inverse_dense() {
    let orig = create_linear_gs().unwrap();
    let mut gs = DenseAdjacencyListStorage::new();
    let mut node_annos = AnnoStorageImpl::new();
    for i in 0..=10 {
        node_annos
            .insert(
                i,
                Annotation {
                    key: NODE_TYPE_KEY.as_ref().clone(),
                    val: "node".into(),
                },
            )
            .unwrap();
    }
    gs.copy(&node_annos, &orig).unwrap();

    let found: Result<Vec<NodeID>> = gs
        .find_connected_inverse(4, 2, std::ops::Bound::Included(3))
        .collect();
    let mut found = found.unwrap();
    found.sort();
    assert_eq!(vec![1, 2], found);

    let found: Result<Vec<NodeID>> = gs
        .find_connected_inverse(3, 1, std::ops::Bound::Excluded(3))
        .collect();
    let mut found = found.unwrap();
    found.sort();
    assert_eq!(vec![1, 2], found);
}