Skip to main content

learning_path_cost

qualia_core_db::modalities::capability_gap

Function learning_path_cost 

Source 
pub fn learning_path_cost(
    nodes: &[u64],
    edges: &[(u64, u64, u32)],
    held: &[u64],
    goal: u64,
) -> Option<u32>
Expand description

Shortest-cost educational path to acquire goal from the held capabilities, over a prerequisite graph edges = (from, to, cost) (“from from you can learn to at cost”). Returns the minimum total cost, or None if goal is unreachable. Bounded Dijkstra (A* with an admissible zero heuristic over a non-negative-cost graph); zero-heap (fixed arrays). nodes enumerates the capability ids (the index space, ≤ MAX_CAP_NODES).