Function cbm_layout_compute

src/ui/layout3d.c:507–786

/* ── Public API ───────────────────────────────────────────────── */

cbm_layout_result_t *cbm_layout_compute(cbm_store_t *store, const char *project,
                                        cbm_layout_level_t level, const char *center_node,
                                        int radius, int max_nodes) {
    if (!store || !project)
        return NULL;
    max_nodes = clamp_max_nodes(max_nodes);
    (void)center_node;
    (void)radius;
    (void)level;

    /* 1. Query nodes */
    cbm_search_params_t params;
    memset(&params, 0, sizeof(params));
    params.project = project;
    params.limit = max_nodes;
    params.min_degree = -1;
    params.max_degree = -1;

    cbm_search_output_t search_out;
    memset(&search_out, 0, sizeof(search_out));
    if (cbm_store_search(store, &params, &search_out) != CBM_STORE_OK)
        return calloc(CBM_ALLOC_ONE, sizeof(cbm_layout_result_t));

    int n = search_out.count, total_count = search_out.total;
    if (n == 0) {
        cbm_store_search_free(&search_out);
        cbm_layout_result_t *r = calloc(CBM_ALLOC_ONE, sizeof(*r));
        if (r)
            r->total_nodes = total_count;
        return r;
    }

    /* 2. Build sorted node-ID → index map for O(log n) edge filtering */
    node_id_entry_t *id_map = malloc((size_t)n * sizeof(node_id_entry_t));
    if (!id_map) {
        cbm_store_search_free(&search_out);
        cbm_layout_result_t *r = calloc(CBM_ALLOC_ONE, sizeof(*r));
        if (r) {
            r->total_nodes = total_count;
        }
        return r;
    }
    for (int i = 0; i < n; i++) {
        id_map[i].id = search_out.results[i].node.id;
        id_map[i].idx = i;
    }
    qsort(id_map, (size_t)n, sizeof(node_id_entry_t), cmp_node_id_entry);

    /* 3. Query edges — filter during fetch via binary search (O(e log n)) */
    int *deg = calloc((size_t)n, sizeof(int));
    int mapped = 0;
    int edge_cap = CBM_SZ_256;
    cbm_edge_t *all_edges = malloc((size_t)edge_cap * sizeof(cbm_edge_t));
    int *es = malloc((size_t)edge_cap * sizeof(int));
    int *ed = malloc((size_t)edge_cap * sizeof(int));
    cbm_schema_info_t schema;
    memset(&schema, 0, sizeof(schema));
    if (deg && all_edges && es && ed &&