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

use serde_json::json;
use sqlitegraph::{GraphEdge, GraphEntity, SqliteGraph, cache::AdjacencyCache};

#[test]
fn test_adjacency_cache_get_insert_clear() {
    let cache = AdjacencyCache::new();
    assert!(cache.get(1).is_none());
    cache.insert(1, vec![2, 3]);
    assert_eq!(cache.get(1), Some(vec![2, 3]));
    cache.clear();
    assert!(cache.get(1).is_none());
}

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

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

#[test]
fn test_cache_invalidated_when_edges_change() {
    let graph = SqliteGraph::open_in_memory().unwrap();
    let a = insert_entity(&graph, "A");
    let b = insert_entity(&graph, "B");
    let c = insert_entity(&graph, "C");

    insert_edge(&graph, a, b);
    let first = graph.query().outgoing(a).expect("outgoing");
    assert_eq!(first, vec![b]);

    let edge_bc = insert_edge(&graph, a, c);
    let second = graph.query().outgoing(a).expect("outgoing");
    assert_eq!(second, vec![b, c]);

    graph.delete_edge(edge_bc).expect("delete edge");
    let third = graph.query().outgoing(a).expect("outgoing");
    assert_eq!(third, vec![b]);
}