sqlitegraph 3.9.0

Embedded graph database with explicit SQLite, native-v3, and combined backend modes; HNSW vector search; and graph algorithms
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

use super::{V3Backend, map_v3_error};
use crate::SqliteGraphError;
use crate::backend::native::v3::edge_compat::Direction as EdgeDirection;
use crate::backend::{BackendDirection, ChainStep};
use crate::snapshot::SnapshotId;

impl V3Backend {
    pub(super) fn chain_query_steps(
        &self,
        _snapshot_id: SnapshotId,
        start: i64,
        chain: &[ChainStep],
    ) -> Result<Vec<i64>, SqliteGraphError> {
        if chain.is_empty() {
            return Ok(vec![start]);
        }

        let mut current_nodes = vec![start];

        for step in chain {
            let dir = match step.direction {
                BackendDirection::Outgoing => EdgeDirection::Outgoing,
                BackendDirection::Incoming => EdgeDirection::Incoming,
            };

            let mut next_nodes = Vec::new();
            let edge_store = self.edge_store.read();

            for &node_id in &current_nodes {
                let neighbors = match step.edge_type.as_ref() {
                    Some(edge_type) => edge_store
                        .neighbors_filtered(node_id, dir, edge_type)
                        .map_err(map_v3_error)?,
                    None => edge_store.neighbors(node_id, dir).map_err(map_v3_error)?,
                };

                next_nodes.extend(neighbors.iter().copied());
            }

            if next_nodes.is_empty() {
                return Ok(Vec::new());
            }

            next_nodes.sort_unstable();
            next_nodes.dedup();
            current_nodes = next_nodes;
        }

        Ok(current_nodes)
    }
}