Function count_dangling_edges

tests/repro/repro_invariant_graph.c:227–252

───────────────────────────────────────────────────────────────────────── * INVARIANT 3: No dangling edges (graph integrity guard). * * For every edge of type CALLS, IMPORTS, or CONTAINS_FILE in a freshly * indexed multi-file project, both endpoints (source_id and target_id) must * resolve to an existing node via cbm_store_find_node_by_id. * * This is a REGRESSION GUARD (expected GREEN on c

 *   Two Python files so the pipeline mints IMPORTS and CALLS edges.
 * ──────────────────────────────────────────────────────────────────────── */
static int count_dangling_edges(cbm_store_t *store, const char *project,
                                const char *edge_type) {
    cbm_edge_t *edges = NULL;
    int edge_count = 0;
    int rc = cbm_store_find_edges_by_type(store, project, edge_type,
                                          &edges, &edge_count);
    if (rc != CBM_STORE_OK) {
        return -1;
    }

    int dangling = 0;
    for (int i = 0; i < edge_count; i++) {
        cbm_node_t src_node;
        cbm_node_t tgt_node;
        if (cbm_store_find_node_by_id(store, edges[i].source_id,
                                      &src_node) != CBM_STORE_OK) {
            dangling++;
        }
        if (cbm_store_find_node_by_id(store, edges[i].target_id,
                                      &tgt_node) != CBM_STORE_OK) {
            dangling++;
        }
    }
    cbm_store_free_edges(edges, edge_count);
    return dangling;
}

TEST(invariant_no_dangling_edges) {
    static const char callee_py[] =