uqa-graph 0.2.2

Graph store, RPQ, Cypher (lexer/parser/AST/compiler), 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
52
53
54
55
56
57
58

//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

//! Per-graph membership and adjacency indexes.

use super::{BTreeMap, BTreeSet, Edge, EdgeId, Vertex, VertexId};

#[derive(Debug, Default, Clone)]
pub(super) struct Partition {
    pub(super) vertex_ids: BTreeSet<VertexId>,
    pub(super) edge_ids: BTreeSet<EdgeId>,
    pub(super) adj_out: BTreeMap<VertexId, BTreeSet<EdgeId>>,
    pub(super) adj_in: BTreeMap<VertexId, BTreeSet<EdgeId>>,
    pub(super) label_index: BTreeMap<String, BTreeSet<EdgeId>>,
    pub(super) vertex_label_index: BTreeMap<String, BTreeSet<VertexId>>,
}

impl Partition {
    pub(super) fn add_vertex(&mut self, vertex: &Vertex) {
        self.vertex_ids.insert(vertex.vertex_id);
        self.vertex_label_index
            .entry(vertex.label.clone())
            .or_default()
            .insert(vertex.vertex_id);
    }

    pub(super) fn add_edge(&mut self, edge: &Edge) {
        self.edge_ids.insert(edge.edge_id);
        self.adj_out
            .entry(edge.source_id)
            .or_default()
            .insert(edge.edge_id);
        self.adj_in
            .entry(edge.target_id)
            .or_default()
            .insert(edge.edge_id);
        self.label_index
            .entry(edge.label.clone())
            .or_default()
            .insert(edge.edge_id);
    }

    pub(super) fn remove_edge(&mut self, edge: &Edge) {
        self.edge_ids.remove(&edge.edge_id);
        if let Some(set) = self.adj_out.get_mut(&edge.source_id) {
            set.remove(&edge.edge_id);
        }
        if let Some(set) = self.adj_in.get_mut(&edge.target_id) {
            set.remove(&edge.edge_id);
        }
        if let Some(set) = self.label_index.get_mut(&edge.label) {
            set.remove(&edge.edge_id);
        }
    }
}