@linklabjs/core 0.1.0 → 0.1.2

package/dist/core/PathFinder.js

@@ -0,0 +1,264 @@
+/**
+ * PathFinder - Dijkstra + DFS limité
+ *
+ * Deux algorithmes selon l'usage :
+ *
+ *   findShortestPath()  → Dijkstra  (chemin optimal garanti, performant)
+ *   findAllPaths()      → DFS limité (N meilleurs chemins alternatifs)
+ *
+ * Sur un graphe de métro (300+ stations, 900+ arêtes),
+ * le DFS pur explose. Dijkstra est l'algorithme correct.
+ */
+export class PathFinder {
+    graph;
+    adjacencyList;
+    constructor(graph) {
+        this.graph = graph;
+        this.adjacencyList = this.buildAdjacencyList(graph);
+    }
+    // ==================== DIJKSTRA ====================
+    /**
+     * Chemin le plus court par poids (Dijkstra).
+     * Garanti optimal. Performant sur grands graphes.
+     */
+    findShortestPath(from, to) {
+        const dist = new Map();
+        const prev = new Map();
+        const visited = new Set();
+        // Initialisation
+        for (const node of this.graph.nodes) {
+            dist.set(node.id, Infinity);
+        }
+        dist.set(from, 0);
+        prev.set(from, null);
+        // Priority queue simple (pour notre taille, suffisant)
+        const queue = new Set(this.graph.nodes.map(n => n.id));
+        while (queue.size > 0) {
+            // Nœud non visité avec distance minimale
+            let u = null;
+            let minDist = Infinity;
+            for (const node of queue) {
+                const d = dist.get(node) ?? Infinity;
+                if (d < minDist) {
+                    minDist = d;
+                    u = node;
+                }
+            }
+            if (u === null || u === to)
+                break;
+            if (minDist === Infinity)
+                break; // Graphe non connexe
+            queue.delete(u);
+            visited.add(u);
+            const neighbors = this.adjacencyList.get(u) ?? [];
+            for (const { to: v, edge } of neighbors) {
+                if (visited.has(v))
+                    continue;
+                const alt = (dist.get(u) ?? Infinity) + edge.weight;
+                if (alt < (dist.get(v) ?? Infinity)) {
+                    dist.set(v, alt);
+                    prev.set(v, { node: u, edge });
+                }
+            }
+        }
+        if (!prev.has(to) && to !== from)
+            return null;
+        if ((dist.get(to) ?? Infinity) === Infinity)
+            return null;
+        // Reconstruction du chemin
+        const path = [];
+        const edges = [];
+        let current = to;
+        while (current !== null) {
+            path.unshift(current);
+            const p = prev.get(current);
+            if (p) {
+                edges.unshift(p.edge);
+                current = p.node;
+            }
+            else {
+                current = null;
+            }
+        }
+        return {
+            path,
+            edges,
+            length: path.length,
+            joins: path.length - 1,
+            weight: dist.get(to) ?? 0,
+            indirect: path.length > 2
+        };
+    }
+    /**
+     * N meilleurs chemins (Yen's K-shortest paths simplifié).
+     * Trouve le plus court via Dijkstra, puis des alternatives
+     * en pénalisant les arêtes du chemin précédent.
+     */
+    findAllPaths(from, to, maxPaths = 3, _maxDepth = 50, transferPenalty = 0, allowedVia, minHops = 0) {
+        const results = [];
+        const penalized = new Set(); // arêtes temporairement exclues
+        for (let k = 0; k < maxPaths; k++) {
+            const result = this.dijkstraWithExclusions(from, to, penalized, transferPenalty, allowedVia, minHops);
+            if (!result)
+                break;
+            results.push(result);
+            // Pénaliser la dernière arête du chemin trouvé pour forcer une alternative
+            if (result.edges.length > 0) {
+                const lastEdge = result.edges[result.edges.length - 1];
+                penalized.add(lastEdge.name ?? `${lastEdge.from}->${lastEdge.to}`);
+            }
+        }
+        return results.map(r => r.path);
+    }
+    /**
+     * Dijkstra avec exclusion d'arêtes (pour les chemins alternatifs)
+     */
+    dijkstraWithExclusions(from, to, excluded, transferPenalty = 0, allowedVia, minHops = 0) {
+        const dist = new Map();
+        const prev = new Map();
+        const visited = new Set();
+        for (const node of this.graph.nodes)
+            dist.set(node.id, Infinity);
+        dist.set(from, 0);
+        prev.set(from, null);
+        const queue = new Set(this.graph.nodes.map(n => n.id));
+        while (queue.size > 0) {
+            let u = null;
+            let minDist = Infinity;
+            for (const node of queue) {
+                const d = dist.get(node) ?? Infinity;
+                if (d < minDist) {
+                    minDist = d;
+                    u = node;
+                }
+            }
+            if (u === null || u === to || minDist === Infinity)
+                break;
+            queue.delete(u);
+            visited.add(u);
+            for (const { to: v, edge } of this.adjacencyList.get(u) ?? []) {
+                if (visited.has(v))
+                    continue;
+                const edgeKey = edge.name ?? `${edge.from}->${edge.to}`;
+                if (excluded.has(edgeKey))
+                    continue;
+                // Filtre via — si spécifié, ignorer les arêtes dont le type n'est pas dans la liste
+                if (allowedVia && allowedVia.length > 0) {
+                    const edgeType = edge.metadata?.type ?? edge.via;
+                    if (!allowedVia.includes(edgeType))
+                        continue;
+                }
+                // Pénalité sur changement de ligne — deux cas :
+                // 1. Arête explicitement TRANSFER (self-loop de correspondance)
+                // 2. Changement de ligne implicite (arête DIRECT mais ligne différente de la précédente)
+                let penalty = 0;
+                if (transferPenalty > 0) {
+                    const isExplicitTransfer = edge.metadata?.type === 'TRANSFER';
+                    const prevEdge = prev.get(u);
+                    const prevLineId = prevEdge?.edge?.metadata?.lineId;
+                    const currLineId = edge.metadata?.lineId;
+                    const isLineChange = prevLineId && currLineId && prevLineId !== currLineId
+                        && edge.metadata?.type !== 'TRANSFER';
+                    if (isExplicitTransfer || isLineChange) {
+                        penalty = transferPenalty;
+                    }
+                }
+                const alt = (dist.get(u) ?? Infinity) + edge.weight + penalty;
+                if (alt < (dist.get(v) ?? Infinity)) {
+                    dist.set(v, alt);
+                    prev.set(v, { node: u, edge });
+                }
+            }
+        }
+        if ((dist.get(to) ?? Infinity) === Infinity)
+            return null;
+        const path = [];
+        const edges = [];
+        let current = to;
+        while (current !== null) {
+            path.unshift(current);
+            const p = prev.get(current);
+            if (p) {
+                edges.unshift(p.edge);
+                current = p.node;
+            }
+            else
+                current = null;
+        }
+        // Filtre minHops — rejeter les chemins trop courts
+        if (minHops > 0 && path.length - 1 < minHops)
+            return null;
+        return {
+            path, edges,
+            length: path.length,
+            joins: path.length - 1,
+            weight: dist.get(to) ?? 0,
+            indirect: path.length > 2
+        };
+    }
+    // ==================== HELPERS ====================
+    getPathWeight(path) {
+        let total = 0;
+        for (let i = 0; i < path.length - 1; i++) {
+            const edge = this.graph.edges.find(e => e.from === path[i] && e.to === path[i + 1]);
+            if (edge)
+                total += edge.weight;
+        }
+        return total;
+    }
+    getPathDetails(path) {
+        const edges = [];
+        for (let i = 0; i < path.length - 1; i++) {
+            const edge = this.graph.edges.find(e => e.from === path[i] && e.to === path[i + 1]);
+            if (edge)
+                edges.push(edge);
+        }
+        return {
+            path, edges,
+            length: path.length,
+            joins: path.length - 1,
+            weight: this.getPathWeight(path),
+            indirect: path.length > 2
+        };
+    }
+    hasPath(from, to) {
+        return this.findShortestPath(from, to) !== null;
+    }
+    getReachableNodes(from, maxDepth = 50) {
+        const reachable = new Set();
+        const visited = new Set();
+        const dfs = (node, depth) => {
+            if (depth > maxDepth || visited.has(node))
+                return;
+            visited.add(node);
+            reachable.add(node);
+            for (const { to } of this.adjacencyList.get(node) ?? [])
+                dfs(to, depth + 1);
+        };
+        dfs(from, 0);
+        reachable.delete(from);
+        return reachable;
+    }
+    buildAdjacencyList(graph) {
+        const adj = new Map();
+        for (const edge of graph.edges) {
+            if (!adj.has(edge.from))
+                adj.set(edge.from, []);
+            adj.get(edge.from).push({ to: edge.to, edge });
+            if (!adj.has(edge.to))
+                adj.set(edge.to, []);
+        }
+        return adj;
+    }
+    getStats() {
+        const degrees = new Map();
+        for (const node of this.graph.nodes)
+            degrees.set(node.id, 0);
+        for (const edge of this.graph.edges) {
+            degrees.set(edge.from, (degrees.get(edge.from) ?? 0) + 1);
+        }
+        const avgDegree = Array.from(degrees.values()).reduce((s, d) => s + d, 0) / degrees.size;
+        return { nodes: this.graph.nodes.length, edges: this.graph.edges.length, avgDegree };
+    }
+}
+//# sourceMappingURL=PathFinder.js.map

package/dist/core/PathFinder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PathFinder.js","sourceRoot":"","sources":["../../src/core/PathFinder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,MAAM,OAAO,UAAU;IAGD;IAFZ,aAAa,CAAqD;IAE1E,YAAoB,KAAY;QAAZ,UAAK,GAAL,KAAK,CAAO;QAC9B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,qDAAqD;IAErD;;;OAGG;IACH,gBAAgB,CAAC,IAAY,EAAE,EAAU;QACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;QACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoD,CAAA;QACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QAEjC,iBAAiB;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QAC7B,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACjB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAEpB,uDAAuD;QACvD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE9D,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtB,yCAAyC;YACzC,IAAI,CAAC,GAAkB,IAAI,CAAA;YAC3B,IAAI,OAAO,GAAG,QAAQ,CAAA;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAA;gBACpC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;oBAChB,OAAO,GAAG,CAAC,CAAA;oBACX,CAAC,GAAG,IAAI,CAAA;gBACV,CAAC;YACH,CAAC;YAED,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE;gBAAE,MAAK;YACjC,IAAI,OAAO,KAAK,QAAQ;gBAAE,MAAK,CAAC,qBAAqB;YAErD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAEd,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;YACjD,KAAK,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,SAAS,EAAE,CAAC;gBACxC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBAE5B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;gBACnD,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;oBACpC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;oBAChB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAA;QAExD,2BAA2B;QAC3B,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,IAAI,OAAO,GAAkB,EAAE,CAAA;QAE/B,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAC3B,IAAI,CAAC,EAAE,CAAC;gBACN,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBACrB,OAAO,GAAG,CAAC,CAAC,IAAI,CAAA;YAClB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI;YACJ,KAAK;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;YACtB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YACzB,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;SAC1B,CAAA;IACH,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,IAAY,EAAE,EAAU,EAAE,QAAQ,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,eAAe,GAAG,CAAC,EAAE,UAAqB,EAAE,OAAO,GAAG,CAAC;QAC1H,MAAM,OAAO,GAAkB,EAAE,CAAA;QACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA,CAAC,gCAAgC;QAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,OAAO,CAAC,CAAA;YACrG,IAAI,CAAC,MAAM;gBAAE,MAAK;YAElB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAEpB,2EAA2E;YAC3E,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;gBACtD,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAA;YACpE,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,IAAY,EACZ,EAAU,EACV,QAAqB,EACrB,eAAe,GAAG,CAAC,EACnB,UAAqB,EACrB,OAAO,GAAG,CAAC;QAEX,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;QACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoD,CAAA;QACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QAEjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QAChE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACjB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE9D,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,GAAkB,IAAI,CAAA;YAC3B,IAAI,OAAO,GAAG,QAAQ,CAAA;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAA;gBACpC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;oBAAC,OAAO,GAAG,CAAC,CAAC;oBAAC,CAAC,GAAG,IAAI,CAAA;gBAAC,CAAC;YAC5C,CAAC;YAED,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,OAAO,KAAK,QAAQ;gBAAE,MAAK;YAEzD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAEd,KAAK,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAA;gBACvD,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAQ;gBAEnC,oFAAoF;gBACpF,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAA;oBAChD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC;wBAAE,SAAQ;gBAC9C,CAAC;gBAED,gDAAgD;gBAChD,gEAAgE;gBAChE,yFAAyF;gBACzF,IAAI,OAAO,GAAG,CAAC,CAAA;gBACf,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,kBAAkB,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,KAAK,UAAU,CAAA;oBAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBAC5B,MAAM,UAAU,GAAG,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAA;oBACnD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAA;oBACxC,MAAM,YAAY,GAAG,UAAU,IAAI,UAAU,IAAI,UAAU,KAAK,UAAU;2BACrE,IAAI,CAAC,QAAQ,EAAE,IAAI,KAAK,UAAU,CAAA;oBACvC,IAAI,kBAAkB,IAAI,YAAY,EAAE,CAAC;wBACvC,OAAO,GAAG,eAAe,CAAA;oBAC3B,CAAC;gBACH,CAAC;gBACD,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,CAAA;gBAC7D,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;oBACpC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;oBAChB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAA;QAExD,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,IAAI,OAAO,GAAkB,EAAE,CAAA;QAE/B,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAC3B,IAAI,CAAC,EAAE,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAA;YAAC,CAAC;;gBAC7C,OAAO,GAAG,IAAI,CAAA;QACrB,CAAC;QAED,mDAAmD;QACnD,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO;YAAE,OAAO,IAAI,CAAA;QAEzD,OAAO;YACL,IAAI,EAAE,KAAK;YACX,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;YACtB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YACzB,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;SAC1B,CAAA;IACH,CAAC;IAED,oDAAoD;IAEpD,aAAa,CAAC,IAAU;QACtB,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACnF,IAAI,IAAI;gBAAE,KAAK,IAAI,IAAI,CAAC,MAAM,CAAA;QAChC,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,cAAc,CAAC,IAAU;QACvB,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACnF,IAAI,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC5B,CAAC;QACD,OAAO;YACL,IAAI,EAAE,KAAK;YACX,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;YACtB,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAChC,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;SAC1B,CAAA;IACH,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,CAAA;IACjD,CAAC;IAED,iBAAiB,CAAC,IAAY,EAAE,QAAQ,GAAG,EAAE;QAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,EAAE;YAC1C,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAM;YACjD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACnB,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QAC7E,CAAC,CAAA;QACD,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACZ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACtB,OAAO,SAAS,CAAA;IAClB,CAAC;IAEO,kBAAkB,CAAC,KAAY;QACrC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkD,CAAA;QACrE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YAC/C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAA;YAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC7C,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,QAAQ;QACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;QACzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QAC5D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3D,CAAC;QACD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAA;QACxF,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IACtF,CAAC;CACF"}

package/dist/formatters/BaseFormatter.d.ts

@@ -0,0 +1,15 @@
+/**
+ * BaseFormatter - Interface pour les formatters de sortie
+ *
+ * Chaque scénario peut avoir son propre formatter.
+ * Le formatter transforme un résultat brut du NavigationEngine
+ * en sortie lisible par un humain.
+ */
+import type { NavigationPath, EngineStepResult } from '../types/index.js';
+export interface PathFormatter {
+    /** Formate un chemin pour l'affichage humain */
+    format(path: NavigationPath): string;
+    /** Formate un step complet de résultat */
+    formatResult(result: EngineStepResult): string;
+}
+//# sourceMappingURL=BaseFormatter.d.ts.map

package/dist/formatters/BaseFormatter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BaseFormatter.d.ts","sourceRoot":"","sources":["../../src/formatters/BaseFormatter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAEzE,MAAM,WAAW,aAAa;IAC5B,gDAAgD;IAChD,MAAM,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAAA;IAEpC,0CAA0C;IAC1C,YAAY,CAAC,MAAM,EAAE,gBAAgB,GAAG,MAAM,CAAA;CAC/C"}

package/dist/formatters/BaseFormatter.js

@@ -0,0 +1,9 @@
+/**
+ * BaseFormatter - Interface pour les formatters de sortie
+ *
+ * Chaque scénario peut avoir son propre formatter.
+ * Le formatter transforme un résultat brut du NavigationEngine
+ * en sortie lisible par un humain.
+ */
+export {};
+//# sourceMappingURL=BaseFormatter.js.map

package/dist/formatters/BaseFormatter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BaseFormatter.js","sourceRoot":"","sources":["../../src/formatters/BaseFormatter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/graph/GraphAssembler.d.ts

@@ -0,0 +1,14 @@
+/**
+ * GraphAssembler — Dictionary → Graph V3
+ *
+ * Transforme le Dictionary produit par GraphBuilder
+ * en Graph V3 (nodes + edges) prêt pour PathFinder.
+ *
+ * Corrige le bug d'itération : dictionary.tables est une Table[]
+ * (liste), pas un Record<string, Table> (dictionnaire).
+ */
+import type { Dictionary, Graph } from '../types/index.js';
+export declare class GraphAssembler {
+    assemble(dictionary: Dictionary): Graph;
+}
+//# sourceMappingURL=GraphAssembler.d.ts.map

package/dist/graph/GraphAssembler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphAssembler.d.ts","sourceRoot":"","sources":["../../src/graph/GraphAssembler.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,KAAK,EAAwB,MAAM,mBAAmB,CAAA;AAEhF,qBAAa,cAAc;IAEzB,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,KAAK;CAmCxC"}

package/dist/graph/GraphAssembler.js

@@ -0,0 +1,44 @@
+/**
+ * GraphAssembler — Dictionary → Graph V3
+ *
+ * Transforme le Dictionary produit par GraphBuilder
+ * en Graph V3 (nodes + edges) prêt pour PathFinder.
+ *
+ * Corrige le bug d'itération : dictionary.tables est une Table[]
+ * (liste), pas un Record<string, Table> (dictionnaire).
+ */
+export class GraphAssembler {
+    assemble(dictionary) {
+        const nodes = [];
+        const edges = [];
+        // 1. Tables → Nodes
+        // dictionary.tables est une Table[] — itération sur les éléments, pas les indices
+        for (const table of dictionary.tables) {
+            nodes.push({
+                id: table.name,
+                type: 'table',
+                rowCount: table.rowCount,
+                columns: table.columns.map(c => ({ name: c, type: 'string' }))
+            });
+        }
+        // 2. Relations → Edges
+        for (const rel of dictionary.relations) {
+            edges.push({
+                name: rel.label,
+                from: rel.from,
+                to: rel.to,
+                via: rel.via,
+                weight: typeof rel.weight === 'string'
+                    ? parseFloat(rel.weight)
+                    : (rel.weight ?? 1),
+                metadata: {
+                    type: rel.type,
+                    condition: rel.condition,
+                    metadataField: rel.metadataField
+                }
+            });
+        }
+        return { nodes, edges };
+    }
+}
+//# sourceMappingURL=GraphAssembler.js.map

package/dist/graph/GraphAssembler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphAssembler.js","sourceRoot":"","sources":["../../src/graph/GraphAssembler.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,MAAM,OAAO,cAAc;IAEzB,QAAQ,CAAC,UAAsB;QAC7B,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,MAAM,KAAK,GAAgB,EAAE,CAAA;QAE7B,oBAAoB;QACpB,kFAAkF;QAClF,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,KAAK,CAAC,IAAI;gBACd,IAAI,EAAE,OAAO;gBACb,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;aAC/D,CAAC,CAAA;QACJ,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,GAAG,CAAC,KAAK;gBACf,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,GAAG,EAAE,GAAG,CAAC,GAAG;gBACZ,MAAM,EAAE,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ;oBACpC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;oBACxB,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;gBACrB,QAAQ,EAAE;oBACR,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,SAAS,EAAE,GAAG,CAAC,SAAS;oBACxB,aAAa,EAAE,GAAG,CAAC,aAAa;iBACjC;aACF,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC;CACF"}

package/dist/graph/GraphCompiler.d.ts

@@ -0,0 +1,37 @@
+/**
+ * GraphCompiler — v2.0.0
+ *
+ * Changements vs v1 :
+ *   - Routes sémantiques (semantic_view) compilées et incluses
+ *   - compiled-graph contient physical + semantic routes
+ *   - version bump : '2.0.0'
+ *
+ * v2.1 :
+ *   - Support expose config (ADR-0010)
+ *   - node.exposed compilé depuis CompilerConfig.expose
+ */
+import type { Graph, CompiledGraph, CompilerConfig, MetricsMap } from '../types/index.js';
+export interface EdgeMetadata {
+    fromCol: string;
+    toCol: string;
+    condition?: Record<string, unknown>;
+    label?: string;
+}
+export declare class GraphCompiler {
+    private config;
+    constructor(config?: Partial<CompilerConfig>);
+    compile(graph: Graph, metrics: MetricsMap): CompiledGraph;
+    private compileNodes;
+    private compileSemanticRoute;
+    private getAllPairs;
+    private compilePath;
+    private resolveEdges;
+    static getStats(compiled: CompiledGraph): {
+        totalRoutes: number;
+        fallbackRatio: string;
+        semantic: number;
+        physical: number;
+        composed: number;
+    };
+}
+//# sourceMappingURL=GraphCompiler.d.ts.map

package/dist/graph/GraphCompiler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphCompiler.d.ts","sourceRoot":"","sources":["../../src/graph/GraphCompiler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,cAAc,EAAa,UAAU,EAA2B,MAAM,mBAAmB,CAAA;AAG7H,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAA;IACf,KAAK,EAAE,MAAM,CAAA;IACb,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IACnC,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAqE;gBAEvE,MAAM,GAAE,OAAO,CAAC,cAAc,CAAM;IAUhD,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,GAAG,aAAa;IAiLzD,OAAO,CAAC,YAAY;IAoBpB,OAAO,CAAC,oBAAoB;IAmD5B,OAAO,CAAC,WAAW;IAMnB,OAAO,CAAC,WAAW;IA6EnB,OAAO,CAAC,YAAY;IA4BpB,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,aAAa;;;;;;;CAgBxC"}