sqlitegraph 2.2.2

Embedded graph database with full ACID transactions, HNSW vector search, dual backend support, and comprehensive graph algorithms 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

use serde_json::json;
use sqlitegraph::backend::BackendDirection;
use sqlitegraph::pattern::{self, NodeConstraint, PatternLeg, PatternQuery};
use sqlitegraph::{GraphEdge, GraphEntity, SqliteGraph};

fn insert_node(graph: &SqliteGraph, kind: &str, name: &str) -> i64 {
    graph
        .insert_entity(&GraphEntity {
            id: 0,
            kind: kind.into(),
            name: name.into(),
            file_path: None,
            data: json!({"name": name}),
        })
        .expect("insert node")
}

fn insert_edge(graph: &SqliteGraph, from: i64, to: i64, edge_type: &str) {
    graph
        .insert_edge(&GraphEdge {
            id: 0,
            from_id: from,
            to_id: to,
            edge_type: edge_type.into(),
            data: json!({}),
        })
        .expect("insert edge");
}

fn build_graph() -> (SqliteGraph, Vec<i64>) {
    let graph = SqliteGraph::open_in_memory().expect("graph");
    let f1 = insert_node(&graph, "Function", "A_func");
    let f2 = insert_node(&graph, "Function", "B_func");
    let f3 = insert_node(&graph, "Function", "C_func");
    let s1 = insert_node(&graph, "Struct", "S_alpha");
    let s2 = insert_node(&graph, "Struct", "S_beta");

    insert_edge(&graph, f1, f2, "CALLS");
    insert_edge(&graph, f2, s1, "USES");
    insert_edge(&graph, f1, f3, "CALLS");
    insert_edge(&graph, f3, s2, "USES");
    insert_edge(&graph, f2, f3, "CALLS");

    (graph, vec![f1, f2, f3, s1, s2])
}

#[test]
fn test_pattern_query_matches_kind_chain() {
    let (graph, ids) = build_graph();
    let pattern = PatternQuery {
        root: Some(NodeConstraint::kind("Function")),
        legs: vec![
            PatternLeg {
                direction: BackendDirection::Outgoing,
                edge_type: Some("CALLS".into()),
                constraint: Some(NodeConstraint::kind("Function")),
            },
            PatternLeg {
                direction: BackendDirection::Outgoing,
                edge_type: Some("USES".into()),
                constraint: Some(NodeConstraint::kind("Struct")),
            },
        ],
    };
    let matches = graph
        .query()
        .pattern_matches(ids[0], &pattern)
        .expect("pattern");
    let sequences: Vec<Vec<i64>> = matches.into_iter().map(|m| m.nodes).collect();
    assert_eq!(
        sequences,
        vec![vec![ids[0], ids[1], ids[3]], vec![ids[0], ids[2], ids[4]]]
    );
}

#[test]
fn test_pattern_query_blocks_root_constraint() {
    let (graph, ids) = build_graph();
    let pattern = PatternQuery {
        root: Some(NodeConstraint::kind("Struct")),
        legs: vec![PatternLeg {
            direction: BackendDirection::Outgoing,
            edge_type: Some("CALLS".into()),
            constraint: Some(NodeConstraint::kind("Function")),
        }],
    };
    let matches = graph
        .query()
        .pattern_matches(ids[0], &pattern)
        .expect("pattern");
    assert!(matches.is_empty());
}

#[test]
fn entity_ids_with_constraint_filters_by_kind_and_prefix() {
    let graph = SqliteGraph::open_in_memory().expect("graph");
    let alpha_fn = insert_node(&graph, "Fn", "alpha_fn");
    let beta_fn = insert_node(&graph, "Fn", "beta_fn");
    let _module = insert_node(&graph, "Module", "alpha_mod");

    let mut constraint = NodeConstraint::kind("Fn");
    let ids = pattern::entity_ids_with_constraint(&graph, &constraint).expect("ids");
    assert_eq!(ids, vec![alpha_fn, beta_fn]);

    constraint.name_prefix = Some("alpha".into());
    let ids = pattern::entity_ids_with_constraint(&graph, &constraint).expect("prefixed");
    assert_eq!(ids, vec![alpha_fn]);
}

#[test]
fn test_pattern_query_with_name_prefix_filter() {
    let (graph, ids) = build_graph();
    let pattern = PatternQuery {
        root: Some(NodeConstraint::name_prefix("A_")),
        legs: vec![
            PatternLeg {
                direction: BackendDirection::Outgoing,
                edge_type: Some("CALLS".into()),
                constraint: Some(NodeConstraint::name_prefix("B_")),
            },
            PatternLeg {
                direction: BackendDirection::Outgoing,
                edge_type: Some("USES".into()),
                constraint: Some(NodeConstraint::name_prefix("S_a")),
            },
        ],
    };
    let matches = graph
        .query()
        .pattern_matches(ids[0], &pattern)
        .expect("pattern");
    let sequences: Vec<Vec<i64>> = matches.into_iter().map(|m| m.nodes).collect();
    assert_eq!(sequences, vec![vec![ids[0], ids[1], ids[3]]]);
}