aprender-graph 0.32.0

GPU-first embedded graph database for code analysis (call graphs, dependencies, AST traversals)
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

//! Integration tests for trueno-graph
//!
//! Tests real-world usage scenarios (call graphs, dependency graphs)

use trueno_graph::{CsrGraph, NodeId};

#[test]
fn test_simple_call_graph() {
    // Build a simple call graph:
    // main() → parse_args(), validate(), execute()
    // parse_args() → validate()

    let mut graph = CsrGraph::new();

    // Add edges
    graph.add_edge(NodeId(0), NodeId(1), 1.0).unwrap(); // main → parse_args
    graph.add_edge(NodeId(0), NodeId(2), 1.0).unwrap(); // main → validate
    graph.add_edge(NodeId(0), NodeId(3), 1.0).unwrap(); // main → execute
    graph.add_edge(NodeId(1), NodeId(2), 1.0).unwrap(); // parse_args → validate

    // Add node names
    graph.set_node_name(NodeId(0), "main".to_string());
    graph.set_node_name(NodeId(1), "parse_args".to_string());
    graph.set_node_name(NodeId(2), "validate".to_string());
    graph.set_node_name(NodeId(3), "execute".to_string());

    // Test outgoing edges (callees)
    let main_callees = graph.outgoing_neighbors(NodeId(0)).unwrap();
    assert_eq!(main_callees, &[1, 2, 3]);

    let parse_args_callees = graph.outgoing_neighbors(NodeId(1)).unwrap();
    assert_eq!(parse_args_callees, &[2]);

    // Test incoming edges (callers)
    let validate_callers = graph.incoming_neighbors(NodeId(2)).unwrap();
    assert_eq!(validate_callers, vec![0, 1]);

    // Test graph metrics
    assert_eq!(graph.num_nodes(), 4);
    assert_eq!(graph.num_edges(), 4);
}

#[test]
fn test_from_edge_list_performance() {
    // Test building graph from edge list (batch mode)
    let edges: Vec<_> = (0..1000).map(|i| (NodeId(i), NodeId(i + 1), 1.0)).collect();

    let graph = CsrGraph::from_edge_list(&edges).unwrap();

    assert_eq!(graph.num_nodes(), 1001);
    assert_eq!(graph.num_edges(), 1000);

    // Verify first and last edges
    assert_eq!(graph.outgoing_neighbors(NodeId(0)).unwrap(), &[1]);
    assert_eq!(graph.outgoing_neighbors(NodeId(999)).unwrap(), &[1000]);
}

#[tokio::test]
async fn test_parquet_persistence() {
    use tempfile::tempdir;

    let dir = tempdir().unwrap();
    let path = dir.path().join("call_graph");

    // Build graph
    let mut graph = CsrGraph::new();
    graph.add_edge(NodeId(0), NodeId(1), 1.0).unwrap();
    graph.add_edge(NodeId(0), NodeId(2), 2.0).unwrap();
    graph.set_node_name(NodeId(0), "main".to_string());
    graph.set_node_name(NodeId(1), "foo".to_string());
    graph.set_node_name(NodeId(2), "bar".to_string());

    // Save
    graph.write_parquet(&path).await.unwrap();

    // Verify files exist
    assert!(std::path::Path::new(&format!("{}_edges.parquet", path.display())).exists());
    assert!(std::path::Path::new(&format!("{}_nodes.parquet", path.display())).exists());

    // Load
    let loaded = CsrGraph::read_parquet(&path).await.unwrap();

    // Verify
    assert_eq!(loaded.num_nodes(), 3);
    assert_eq!(loaded.num_edges(), 2);
    assert_eq!(loaded.get_node_name(NodeId(0)), Some("main"));
}

#[test]
fn test_csr_components_for_aprender() {
    // Test CSR component extraction (for aprender integration)
    let edges =
        vec![(NodeId(0), NodeId(1), 1.0), (NodeId(0), NodeId(2), 2.0), (NodeId(1), NodeId(2), 3.0)];

    let graph = CsrGraph::from_edge_list(&edges).unwrap();
    let (row_offsets, col_indices, weights) = graph.csr_components();

    // Verify CSR format
    assert_eq!(row_offsets, &[0, 2, 3, 3]);
    assert_eq!(col_indices, &[1, 2, 2]);
    assert_eq!(weights, &[1.0, 2.0, 3.0]);
}

#[test]
fn test_adjacency_iteration() {
    // Test iter_adjacency for complete graph processing
    let edges = vec![
        (NodeId(0), NodeId(1), 1.5),
        (NodeId(0), NodeId(2), 2.5),
        (NodeId(1), NodeId(2), 3.5),
        (NodeId(1), NodeId(3), 4.5),
    ];

    let graph = CsrGraph::from_edge_list(&edges).unwrap();

    // Test adjacency method
    let (targets, weights) = graph.adjacency(NodeId(0));
    assert_eq!(targets, &[1, 2]);
    assert_eq!(weights, &[1.5, 2.5]);

    let (targets, weights) = graph.adjacency(NodeId(1));
    assert_eq!(targets, &[2, 3]);
    assert_eq!(weights, &[3.5, 4.5]);

    // Test iterator
    let adjacencies: Vec<_> = graph.iter_adjacency().collect();
    assert_eq!(adjacencies.len(), 4);

    // Verify slices
    assert_eq!(graph.row_offsets_slice(), &[0, 2, 4, 4, 4]);
    assert_eq!(graph.col_indices_slice(), &[1, 2, 2, 3]);
    assert_eq!(graph.edge_weights_slice(), &[1.5, 2.5, 3.5, 4.5]);
}