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

use serde_json::json;
use sqlitegraph::{
    graph::{GraphEntity, SqliteGraph},
    index::{add_label, add_property, get_entities_by_label, get_entities_by_property},
};

fn graph() -> SqliteGraph {
    SqliteGraph::open_in_memory().expect("graph")
}

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

#[test]
fn test_label_roundtrip() {
    let g = graph();
    let id = insert_node(&g, "A");
    add_label(&g, id, "Module").unwrap();
    let entities = get_entities_by_label(&g, "Module").unwrap();
    assert_eq!(entities.len(), 1);
    assert_eq!(entities[0].id, id);
}

#[test]
fn test_property_roundtrip() {
    let g = graph();
    let id = insert_node(&g, "A");
    add_property(&g, id, "role", "leaf").unwrap();
    let entities = get_entities_by_property(&g, "role", "leaf").unwrap();
    assert_eq!(entities[0].id, id);
}

#[test]
fn test_multi_label_entries() {
    let g = graph();
    let id = insert_node(&g, "A");
    let id2 = insert_node(&g, "B");
    add_label(&g, id, "Service").unwrap();
    add_label(&g, id2, "Service").unwrap();
    let entities = get_entities_by_label(&g, "Service").unwrap();
    assert_eq!(entities.len(), 2);
    assert!(entities[0].id < entities[1].id);
}

#[test]
fn test_ordering_consistency() {
    let g = graph();
    let id1 = insert_node(&g, "A");
    let id2 = insert_node(&g, "B");
    add_property(&g, id2, "tier", "1").unwrap();
    add_property(&g, id1, "tier", "1").unwrap();
    let entities = get_entities_by_property(&g, "tier", "1").unwrap();
    assert_eq!(
        entities.into_iter().map(|e| e.id).collect::<Vec<_>>(),
        vec![id1, id2]
    );
}

#[test]
fn test_selective_property_match() {
    let g = graph();
    let id = insert_node(&g, "A");
    add_property(&g, id, "kind", "fn").unwrap();
    let empty = get_entities_by_property(&g, "kind", "type").unwrap();
    assert!(empty.is_empty());
}