kglite 0.16.24

Pure-Rust embedded Cypher knowledge graph engine with in-memory, mmap, and disk storage, and agent-facing schema introspection
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

use super::*;
use petgraph::graph::NodeIndex;

#[test]
fn exact_undirected_counter_keeps_each_loop_once_and_parallel_edges_distinct() {
    let mut graph = build_test_graph();
    for _ in 0..2 {
        let edge = EdgeData::new("KNOWS".into(), HashMap::new(), &mut graph.interner);
        graph
            .graph
            .add_edge(NodeIndex::new(0), NodeIndex::new(0), edge);
    }
    let params = HashMap::new();
    let executor = CypherExecutor::with_params(&graph, &params, None);
    let query = parser::parse_cypher("MATCH(a:Person)-[:KNOWS]-(b:Person) RETURN b").unwrap();
    let Clause::Match(matched) = &query.clauses[0] else {
        panic!("MATCH expected")
    };
    let mut bindings = Bindings::new();
    bindings.insert("a".into(), NodeIndex::new(0));
    assert_eq!(
        executor
            .try_count_simple_pattern(&matched.patterns[0], &bindings)
            .unwrap(),
        Some(3)
    );
    assert_eq!(
        executor
            .try_count_distinct_peers(&matched.patterns[0], &bindings)
            .unwrap(),
        Some(2)
    );
}