@linklabjs/core 0.1.0 → 0.1.2

package/dist/graph/GraphOptimizer.js

@@ -0,0 +1,306 @@
+/**
+ * GraphOptimizer — Analyse et rapport sur la qualité du graphe
+ *
+ * PRINCIPE : signaler, jamais détruire silencieusement.
+ *
+ * Chaque étape produit un rapport (warnings, suggestions).
+ * Le dev décide ensuite de ce qu'il fait.
+ *
+ * Seules deux opérations sont automatiques et non destructives :
+ *   - Suppression des nœuds orphelins (aucune arête — objectivement inutiles)
+ *   - Suppression des nœuds dead-end stricts (aucune arête entrante ET sortante)
+ *
+ * Les cycles sont DÉTECTÉS et CLASSIFIÉS, jamais supprimés :
+ *   - SELF_LOOP         : arête A → A (ex: Station-chatelet → Station-chatelet TRANSFER)
+ *   - BIDIRECTIONAL     : A → B et B → A (ex: CREATED + CREDITED — intentionnel)
+ *   - STRUCTURAL_CYCLE  : A → B → C → A (même type de relation — potentiellement problématique)
+ */
+import { PathFinder } from '../core/PathFinder.js';
+const DEFAULT_CONFIG = {
+    intentionalBidirectional: ['physical_reverse'],
+    intentionalSelfLoops: []
+};
+export class GraphOptimizer {
+    graph;
+    config;
+    constructor(graph, config = {}) {
+        this.graph = graph;
+        this.config = {
+            intentionalBidirectional: config.intentionalBidirectional ?? DEFAULT_CONFIG.intentionalBidirectional,
+            intentionalSelfLoops: config.intentionalSelfLoops ?? DEFAULT_CONFIG.intentionalSelfLoops
+        };
+    }
+    /**
+     * Pipeline complet — retourne un rapport, ne modifie pas le graphe original.
+     * Seuls orphelins et dead-ends stricts sont supprimés (safe).
+     */
+    optimize() {
+        console.log('🔧 GraphOptimizer — analyse du graphe...');
+        const before = {
+            nodes: this.graph.nodes.length,
+            edges: this.graph.edges.length
+        };
+        // Travailler sur une copie
+        const working = {
+            nodes: [...this.graph.nodes],
+            edges: [...this.graph.edges]
+        };
+        // Opérations safe (non destructives sémantiquement)
+        const removedOrphans = this.removeOrphans(working);
+        const removedDeadEnds = this.removeStrictDeadEnds(working);
+        // Analyse — rapport uniquement, pas de suppression
+        const cycles = this.detectCycles(working);
+        const duplicatePaths = this.detectDuplicatePaths(working);
+        const after = {
+            nodes: working.nodes.length,
+            edges: working.edges.length
+        };
+        // Résumé console
+        console.log(`   Nœuds   : ${before.nodes} → ${after.nodes} (-${before.nodes - after.nodes})`);
+        console.log(`   Arêtes  : ${before.edges} → ${after.edges} (-${before.edges - after.edges})`);
+        console.log(`   Cycles  : ${cycles.length} détecté(s)`);
+        console.log(`   Chemins dupliqués : ${duplicatePaths.length} paire(s)`);
+        const isClean = cycles.filter(c => c.severity === 'WARNING').length === 0;
+        if (isClean) {
+            console.log('   ✅ Graphe propre');
+        }
+        else {
+            console.log(`   ⚠️  ${cycles.filter(c => c.severity === 'WARNING').length} warning(s) à examiner`);
+        }
+        const report = {
+            graph: working,
+            summary: {
+                nodes: { before: before.nodes, after: after.nodes, removed: before.nodes - after.nodes },
+                edges: { before: before.edges, after: after.edges, removed: before.edges - after.edges }
+            },
+            cycles,
+            duplicatePaths,
+            removedOrphans,
+            removedDeadEnds,
+            isClean
+        };
+        this.printReport(report);
+        return report;
+    }
+    // ==================== CYCLES ====================
+    /**
+     * Détecte et classifie les cycles — ne supprime rien.
+     */
+    detectCycles(graph) {
+        const warnings = [];
+        const seen = new Set();
+        for (const edge of graph.edges) {
+            // 1. SELF_LOOP : A → A
+            if (edge.from === edge.to) {
+                const key = `SELF:${edge.name}`;
+                if (!seen.has(key)) {
+                    seen.add(key);
+                    const edgeType = edge.metadata?.type ?? edge.via ?? '';
+                    const isIntentional = this.config.intentionalSelfLoops.includes(edgeType);
+                    warnings.push({
+                        type: 'SELF_LOOP',
+                        severity: 'INFO',
+                        edges: [edge.name ?? `${edge.from}→${edge.to}`],
+                        nodes: [edge.from],
+                        note: isIntentional
+                            ? `Self-loop intentionnel (${edgeType}) sur ${edge.from}. Géré par Dijkstra.`
+                            : `Boucle sur ${edge.from}. Géré par Dijkstra (visited), inoffensif.`
+                    });
+                }
+                continue;
+            }
+            // 2. BIDIRECTIONAL : A → B et B → A
+            const reverse = graph.edges.find(e => e.from === edge.to && e.to === edge.from);
+            if (reverse) {
+                const key = [edge.from, edge.to].sort().join('↔');
+                if (!seen.has(key)) {
+                    seen.add(key);
+                    const typeA = edge.metadata?.type ?? '';
+                    const typeB = reverse.metadata?.type ?? '';
+                    const sameType = typeA === typeB;
+                    const isIntentional = !sameType ||
+                        this.config.intentionalBidirectional.includes(typeA) ||
+                        this.config.intentionalBidirectional.includes(typeB);
+                    warnings.push({
+                        type: 'BIDIRECTIONAL',
+                        severity: isIntentional ? 'INFO' : 'WARNING',
+                        edges: [
+                            edge.name ?? `${edge.from}→${edge.to}`,
+                            reverse.name ?? `${reverse.from}→${reverse.to}`
+                        ],
+                        nodes: [edge.from, edge.to],
+                        note: isIntentional
+                            ? `Bidirectionnel intentionnel (${typeA} ↔ ${typeB}) — normal.`
+                            : `Bidirectionnel de même type "${typeA}" non déclaré intentionnel — vérifier.`
+                    });
+                }
+            }
+        }
+        // 3. STRUCTURAL_CYCLE : A → B → C → A (même type de relation)
+        const structuralCycles = this.detectStructuralCycles(graph);
+        warnings.push(...structuralCycles);
+        return warnings;
+    }
+    /**
+     * Détecte les cycles structurels A → B → ... → A
+     * en ne suivant que les arêtes du même type.
+     */
+    detectStructuralCycles(graph) {
+        const warnings = [];
+        const reportedCycles = new Set();
+        // Grouper les arêtes par type
+        const byType = new Map();
+        for (const edge of graph.edges) {
+            const type = edge.metadata?.type ?? edge.via ?? 'unknown';
+            if (!byType.has(type))
+                byType.set(type, []);
+            byType.get(type).push(edge);
+        }
+        for (const [type, edges] of byType) {
+            // DFS sur les arêtes de ce type uniquement
+            const visited = new Set();
+            const inPath = new Set();
+            const pathStack = [];
+            const dfs = (node) => {
+                if (inPath.has(node)) {
+                    // Cycle trouvé — extraire le cycle
+                    const cycleStart = pathStack.indexOf(node);
+                    return pathStack.slice(cycleStart);
+                }
+                if (visited.has(node))
+                    return null;
+                visited.add(node);
+                inPath.add(node);
+                pathStack.push(node);
+                const neighbors = edges.filter(e => e.from === node).map(e => e.to);
+                for (const neighbor of neighbors) {
+                    const cycle = dfs(neighbor);
+                    if (cycle)
+                        return cycle;
+                }
+                pathStack.pop();
+                inPath.delete(node);
+                return null;
+            };
+            for (const edge of edges) {
+                const cycle = dfs(edge.from);
+                if (cycle) {
+                    const key = [...cycle].sort().join(',');
+                    if (!reportedCycles.has(key)) {
+                        reportedCycles.add(key);
+                        warnings.push({
+                            type: 'STRUCTURAL_CYCLE',
+                            severity: 'WARNING',
+                            edges: [],
+                            nodes: cycle,
+                            note: `Cycle structurel sur le type "${type}" : ${cycle.join(' → ')} → ${cycle[0]}`
+                        });
+                    }
+                }
+                visited.clear();
+                inPath.clear();
+                pathStack.length = 0;
+            }
+        }
+        return warnings;
+    }
+    // ==================== SUPPRESSIONS SAFE ====================
+    /**
+     * Supprime les nœuds sans aucune arête (entrante ou sortante).
+     * Inoffensif — un nœud isolé ne contribue à aucune traversée.
+     */
+    removeOrphans(graph) {
+        const connected = new Set();
+        for (const edge of graph.edges) {
+            connected.add(edge.from);
+            connected.add(edge.to);
+        }
+        const orphans = graph.nodes
+            .filter(n => !connected.has(n.id))
+            .map(n => n.id);
+        graph.nodes = graph.nodes.filter(n => connected.has(n.id));
+        if (orphans.length > 0) {
+            console.log(`   🗑️  Orphelins supprimés : ${orphans.join(', ')}`);
+        }
+        return orphans;
+    }
+    /**
+     * Supprime les nœuds sans arête entrante ET sans arête sortante
+     * après suppression des orphelins.
+     * Différent de removeOrphans — cible les nœuds stricts.
+     */
+    removeStrictDeadEnds(graph) {
+        const hasIncoming = new Set();
+        const hasOutgoing = new Set();
+        for (const edge of graph.edges) {
+            hasOutgoing.add(edge.from);
+            hasIncoming.add(edge.to);
+        }
+        const deadEnds = graph.nodes
+            .filter(n => !hasIncoming.has(n.id) && !hasOutgoing.has(n.id))
+            .map(n => n.id);
+        // Déjà couverts par removeOrphans — cette passe est redondante
+        // mais explicite pour la lisibilité
+        graph.nodes = graph.nodes.filter(n => !deadEnds.includes(n.id));
+        return deadEnds;
+    }
+    // ==================== DUPLICATES ====================
+    /**
+     * Détecte les paires de nœuds avec plusieurs chemins possibles.
+     * Informatif — les chemins multiples sont souvent intentionnels (fallbacks).
+     */
+    detectDuplicatePaths(graph) {
+        const warnings = [];
+        const finder = new PathFinder(graph);
+        for (const from of graph.nodes) {
+            for (const to of graph.nodes) {
+                if (from.id === to.id)
+                    continue;
+                try {
+                    const paths = finder.findAllPaths(from.id, to.id, 5);
+                    if (paths.length > 1) {
+                        warnings.push({
+                            from: from.id,
+                            to: to.id,
+                            paths: paths.map(p => p),
+                            note: `${paths.length} chemins entre ${from.id} et ${to.id} — le plus court sera utilisé par défaut.`
+                        });
+                    }
+                }
+                catch {
+                    // Ignorer les erreurs de traversée
+                }
+            }
+        }
+        return warnings;
+    }
+    // ==================== RAPPORT ====================
+    printReport(report) {
+        if (report.cycles.length === 0 && report.duplicatePaths.length === 0)
+            return;
+        console.log('\n📋 RAPPORT GraphOptimizer\n');
+        if (report.removedOrphans.length > 0) {
+            console.log(`🗑️  Orphelins supprimés (${report.removedOrphans.length}) :`);
+            report.removedOrphans.forEach(n => console.log(`   - ${n}`));
+        }
+        // Cycles WARNING uniquement (les INFO sont attendus)
+        const cycleWarnings = report.cycles.filter(c => c.severity === 'WARNING');
+        if (cycleWarnings.length > 0) {
+            console.log(`\n⚠️  Cycles à examiner (${cycleWarnings.length}) :`);
+            cycleWarnings.forEach(c => {
+                console.log(`   [${c.type}] ${c.note}`);
+            });
+        }
+        const cycleInfos = report.cycles.filter(c => c.severity === 'INFO');
+        if (cycleInfos.length > 0) {
+            console.log(`\nℹ️  Cycles intentionnels (${cycleInfos.length}) :`);
+            cycleInfos.forEach(c => {
+                console.log(`   [${c.type}] ${c.note}`);
+            });
+        }
+        if (report.duplicatePaths.length > 0) {
+            console.log(`\nℹ️  Chemins multiples (${report.duplicatePaths.length} paires) — fallbacks disponibles`);
+        }
+    }
+}
+//# sourceMappingURL=GraphOptimizer.js.map

package/dist/graph/GraphOptimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphOptimizer.js","sourceRoot":"","sources":["../../src/graph/GraphOptimizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AAqDlD,MAAM,cAAc,GAAmC;IACrD,wBAAwB,EAAE,CAAC,kBAAkB,CAAC;IAC9C,oBAAoB,EAAE,EAAE;CACzB,CAAA;AAED,MAAM,OAAO,cAAc;IAIL;IAFZ,MAAM,CAAgC;IAE9C,YAAoB,KAAY,EAAE,SAA+B,EAAE;QAA/C,UAAK,GAAL,KAAK,CAAO;QAC9B,IAAI,CAAC,MAAM,GAAG;YACZ,wBAAwB,EAAE,MAAM,CAAC,wBAAwB,IAAI,cAAc,CAAC,wBAAwB;YACpG,oBAAoB,EAAM,MAAM,CAAC,oBAAoB,IAAQ,cAAc,CAAC,oBAAoB;SACjG,CAAA;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAA;QAEvD,MAAM,MAAM,GAAG;YACb,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;YAC9B,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;SAC/B,CAAA;QAED,2BAA2B;QAC3B,MAAM,OAAO,GAAU;YACrB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YAC5B,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;SAC7B,CAAA;QAED,oDAAoD;QACpD,MAAM,cAAc,GAAK,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QACpD,MAAM,eAAe,GAAI,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAA;QAE3D,mDAAmD;QACnD,MAAM,MAAM,GAAa,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;QACnD,MAAM,cAAc,GAAK,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAA;QAE3D,MAAM,KAAK,GAAG;YACZ,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM;YAC3B,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM;SAC5B,CAAA;QAED,iBAAiB;QACjB,OAAO,CAAC,GAAG,CAAC,gBAAgB,MAAM,CAAC,KAAK,MAAM,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAA;QAC7F,OAAO,CAAC,GAAG,CAAC,gBAAgB,MAAM,CAAC,KAAK,MAAM,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAA;QAC7F,OAAO,CAAC,GAAG,CAAC,gBAAgB,MAAM,CAAC,MAAM,aAAa,CAAC,CAAA;QACvD,OAAO,CAAC,GAAG,CAAC,0BAA0B,cAAc,CAAC,MAAM,WAAW,CAAC,CAAA;QAEvE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,CAAA;QAEzE,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAA;QACnC,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,UAAU,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,MAAM,wBAAwB,CAAC,CAAA;QACpG,CAAC;QAED,MAAM,MAAM,GAA4B;YACtC,KAAK,EAAE,OAAO;YACd,OAAO,EAAE;gBACP,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;gBACxF,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;aACzF;YACD,MAAM;YACN,cAAc;YACd,cAAc;YACd,eAAe;YACf,OAAO;SACR,CAAA;QAED,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QACxB,OAAO,MAAM,CAAA;IACf,CAAC;IAED,mDAAmD;IAEnD;;OAEG;IACK,YAAY,CAAC,KAAY;QAC/B,MAAM,QAAQ,GAAmB,EAAE,CAAA;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAE/B,uBAAuB;YACvB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBAC1B,MAAM,GAAG,GAAG,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAA;gBAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBACb,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAA;oBACtD,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;oBACzE,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,WAAW;wBACjB,QAAQ,EAAE,MAAM;wBAChB,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;wBAC/C,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;wBAClB,IAAI,EAAE,aAAa;4BACjB,CAAC,CAAC,2BAA2B,QAAQ,SAAS,IAAI,CAAC,IAAI,sBAAsB;4BAC7E,CAAC,CAAC,cAAc,IAAI,CAAC,IAAI,4CAA4C;qBACxE,CAAC,CAAA;gBACJ,CAAC;gBACD,SAAQ;YACV,CAAC;YAED,oCAAoC;YACpC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/E,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBACb,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAA;oBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAA;oBAC1C,MAAM,QAAQ,GAAG,KAAK,KAAK,KAAK,CAAA;oBAChC,MAAM,aAAa,GACjB,CAAC,QAAQ;wBACT,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,QAAQ,CAAC,KAAK,CAAC;wBACpD,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;oBACtD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,eAAe;wBACrB,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;wBAC5C,KAAK,EAAE;4BACL,IAAI,CAAC,IAAI,IAAO,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE;4BACzC,OAAO,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,EAAE,EAAE;yBAChD;wBACD,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;wBAC3B,IAAI,EAAE,aAAa;4BACjB,CAAC,CAAC,gCAAgC,KAAK,MAAM,KAAK,aAAa;4BAC/D,CAAC,CAAC,gCAAgC,KAAK,wCAAwC;qBAClF,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAA;QAC3D,QAAQ,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAA;QAElC,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAAC,KAAY;QACzC,MAAM,QAAQ,GAAmB,EAAE,CAAA;QACnC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;QAExC,8BAA8B;QAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAA;QAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,SAAS,CAAA;YACzD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YAC3C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACnC,2CAA2C;YAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;YACjC,MAAM,MAAM,GAAI,IAAI,GAAG,EAAU,CAAA;YACjC,MAAM,SAAS,GAAa,EAAE,CAAA;YAE9B,MAAM,GAAG,GAAG,CAAC,IAAY,EAAmB,EAAE;gBAC5C,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrB,mCAAmC;oBACnC,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBAC1C,OAAO,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;gBACpC,CAAC;gBACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAA;gBAElC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACjB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAChB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBACnE,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAA;oBAC3B,IAAI,KAAK;wBAAE,OAAO,KAAK,CAAA;gBACzB,CAAC;gBAED,SAAS,CAAC,GAAG,EAAE,CAAA;gBACf,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACnB,OAAO,IAAI,CAAA;YACb,CAAC,CAAA;YAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC5B,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACvC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC7B,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;wBACvB,QAAQ,CAAC,IAAI,CAAC;4BACZ,IAAI,EAAE,kBAAkB;4BACxB,QAAQ,EAAE,SAAS;4BACnB,KAAK,EAAE,EAAE;4BACT,KAAK,EAAE,KAAK;4BACZ,IAAI,EAAE,iCAAiC,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,EAAE;yBACpF,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;gBACD,OAAO,CAAC,KAAK,EAAE,CAAA;gBACf,MAAM,CAAC,KAAK,EAAE,CAAA;gBACd,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,8DAA8D;IAE9D;;;OAGG;IACK,aAAa,CAAC,KAAY;QAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACxB,CAAC;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK;aACxB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAEjB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,iCAAiC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACpE,CAAC;QAED,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;;;OAIG;IACK,oBAAoB,CAAC,KAAY;QACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;QACrC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;QAErC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1B,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK;aACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAC7D,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAEjB,+DAA+D;QAC/D,oCAAoC;QACpC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE/D,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,uDAAuD;IAEvD;;;OAGG;IACK,oBAAoB,CAAC,KAAY;QACvC,MAAM,QAAQ,GAA2B,EAAE,CAAA;QAC3C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAEpC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;oBAAE,SAAQ;gBAE/B,IAAI,CAAC;oBACH,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;oBACpD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACrB,QAAQ,CAAC,IAAI,CAAC;4BACZ,IAAI,EAAE,IAAI,CAAC,EAAE;4BACb,EAAE,EAAE,EAAE,CAAC,EAAE;4BACT,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;4BACxB,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,kBAAkB,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,2CAA2C;yBACtG,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,mCAAmC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,oDAAoD;IAE5C,WAAW,CAAC,MAA+B;QACjD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAE5E,OAAO,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAA;QAE5C,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,6BAA6B,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAA;YAC3E,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;QAC9D,CAAC;QAED,qDAAqD;QACrD,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAA;QACzE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,4BAA4B,aAAa,CAAC,MAAM,KAAK,CAAC,CAAA;YAClE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACxB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;YACzC,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAA;QACnE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,+BAA+B,UAAU,CAAC,MAAM,KAAK,CAAC,CAAA;YAClE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACrB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;YACzC,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,4BAA4B,MAAM,CAAC,cAAc,CAAC,MAAM,kCAAkC,CAAC,CAAA;QACzG,CAAC;IACH,CAAC;CACF"}

package/dist/graph/GraphTrainer.d.ts

@@ -0,0 +1,52 @@
+/**
+ * GraphTrainer - Trains graph with real use cases
+ *
+ * Benchmarks all paths and assigns weights based on actual performance
+ */
+import type { Graph, UseCase, MetricsMap, TrainingMetrics, Provider } from '../types/index.js';
+export declare class GraphTrainer {
+    private graph;
+    private provider;
+    private metrics;
+    constructor(graph: Graph, provider: Provider);
+    /**
+     * Train graph with use cases
+     */
+    train(useCases: UseCase[]): Promise<MetricsMap>;
+    /**
+     * Train single use case
+     */
+    private trainUseCase;
+    /**
+     * Benchmark a specific path
+     */
+    private benchmarkPath;
+    /**
+     * Build SQL query for a path
+     */
+    private buildQuery;
+    /**
+     * Update graph weights based on metrics
+     */
+    updateWeights(): void;
+    /**
+     * Check if path uses edge
+     */
+    private pathUsesEdge;
+    /**
+     * Get training statistics
+     */
+    getStats(): {
+        total: number;
+        successful: number;
+        failed: number;
+        avgTime: number;
+        fastest: TrainingMetrics | undefined;
+        slowest: TrainingMetrics | undefined;
+    };
+    /**
+     * Get metrics map
+     */
+    getMetrics(): MetricsMap;
+}
+//# sourceMappingURL=GraphTrainer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTrainer.d.ts","sourceRoot":"","sources":["../../src/graph/GraphTrainer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AAG9F,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAO;IACpB,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,OAAO,CAAY;gBAEf,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;IAM5C;;OAEG;IACG,KAAK,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC;IAcrD;;OAEG;YACW,YAAY;IAe1B;;OAEG;YACW,aAAa;IAgE3B;;OAEG;IACH,OAAO,CAAC,UAAU;IAiClB;;OAEG;IACH,aAAa,IAAI,IAAI;IA4BrB;;OAEG;IACH,OAAO,CAAC,YAAY;IASpB;;OAEG;IACH,QAAQ,IAAI;QACV,KAAK,EAAE,MAAM,CAAA;QACb,UAAU,EAAE,MAAM,CAAA;QAClB,MAAM,EAAE,MAAM,CAAA;QACd,OAAO,EAAE,MAAM,CAAA;QACf,OAAO,EAAE,eAAe,GAAG,SAAS,CAAA;QACpC,OAAO,EAAE,eAAe,GAAG,SAAS,CAAA;KACrC;IA6BD;;OAEG;IACH,UAAU,IAAI,UAAU;CAGzB"}

package/dist/graph/GraphTrainer.js

@@ -0,0 +1,188 @@
+/**
+ * GraphTrainer - Trains graph with real use cases
+ *
+ * Benchmarks all paths and assigns weights based on actual performance
+ */
+import { PathFinder } from '../core/PathFinder.js';
+export class GraphTrainer {
+    graph;
+    provider;
+    metrics;
+    constructor(graph, provider) {
+        this.graph = graph;
+        this.provider = provider;
+        this.metrics = new Map();
+    }
+    /**
+     * Train graph with use cases
+     */
+    async train(useCases) {
+        console.log(`🎓 Training graph with ${useCases.length} use cases...\n`);
+        for (const [index, useCase] of useCases.entries()) {
+            console.log(`   [${index + 1}/${useCases.length}] ${useCase.description}`);
+            await this.trainUseCase(useCase);
+        }
+        console.log('\n✅ Training complete');
+        console.log(`   Tested ${this.metrics.size} unique paths`);
+        return this.metrics;
+    }
+    /**
+     * Train single use case
+     */
+    async trainUseCase(useCase) {
+        const { from, to, sampleData } = useCase;
+        // Find all paths
+        const finder = new PathFinder(this.graph);
+        const paths = finder.findAllPaths(from, to);
+        console.log(`      Found ${paths.length} possible paths`);
+        // Benchmark each path
+        for (const path of paths) {
+            await this.benchmarkPath(path, sampleData);
+        }
+    }
+    /**
+     * Benchmark a specific path
+     */
+    async benchmarkPath(path, sampleData) {
+        const pathKey = path.join('→');
+        try {
+            // Build SQL query
+            const query = this.buildQuery(path, sampleData);
+            // Execute multiple times for average
+            const iterations = 3;
+            const times = [];
+            for (let i = 0; i < iterations; i++) {
+                const start = performance.now();
+                await this.provider.query(query.sql, query.params);
+                const duration = performance.now() - start;
+                times.push(duration);
+            }
+            const avgTime = times.reduce((a, b) => a + b, 0) / times.length;
+            const minTime = Math.min(...times);
+            const maxTime = Math.max(...times);
+            // Store metrics
+            if (!this.metrics.has(pathKey)) {
+                this.metrics.set(pathKey, {
+                    path,
+                    executions: 0,
+                    successes: 0,
+                    failures: 0,
+                    totalTime: 0,
+                    avgTime: 0,
+                    minTime: Infinity,
+                    maxTime: 0,
+                    used: true
+                });
+            }
+            const metric = this.metrics.get(pathKey);
+            metric.executions += iterations;
+            metric.successes = (metric.successes || 0) + iterations;
+            metric.totalTime += avgTime * iterations;
+            metric.avgTime = metric.totalTime / metric.executions;
+            metric.minTime = Math.min(metric.minTime, minTime);
+            metric.maxTime = Math.max(metric.maxTime, maxTime);
+            console.log(`      ✓ ${pathKey}: ${avgTime.toFixed(2)}ms avg`);
+        }
+        catch (err) {
+            console.log(`      ✗ ${pathKey}: Failed - ${err.message}`);
+            // Mark as failed
+            this.metrics.set(pathKey, {
+                path,
+                executions: 0,
+                totalTime: 0,
+                avgTime: 0,
+                minTime: 0,
+                maxTime: 0,
+                used: false,
+                failed: true,
+                error: err.message
+            });
+        }
+    }
+    /**
+     * Build SQL query for a path
+     */
+    buildQuery(path, sampleData) {
+        // Start with first table
+        let sql = `SELECT * FROM ${path[0]}`;
+        const params = [];
+        // Add JOINs
+        for (let i = 1; i < path.length; i++) {
+            const from = path[i - 1];
+            const to = path[i];
+            // Find edge
+            const edge = this.graph.edges.find(e => e.from === from && e.to === to);
+            if (edge) {
+                sql += ` JOIN ${to} ON ${from}.${edge.via} = ${to}.id`;
+            }
+        }
+        // Add WHERE if sample data provided
+        if (sampleData?.id) {
+            sql += ` WHERE ${path[0]}.id = $${params.length + 1}`;
+            params.push(sampleData.id);
+        }
+        // Limit for safety
+        sql += ' LIMIT 100';
+        return { sql, params };
+    }
+    /**
+     * Update graph weights based on metrics
+     */
+    updateWeights() {
+        console.log('📊 Updating graph weights based on metrics...');
+        let updated = 0;
+        for (const edge of this.graph.edges) {
+            // Find all paths using this edge
+            const pathsWithEdge = Array.from(this.metrics.values()).filter(m => !m.failed && this.pathUsesEdge(m.path, edge));
+            if (pathsWithEdge.length === 0)
+                continue;
+            // Calculate new weight (average time)
+            const avgTime = pathsWithEdge.reduce((sum, m) => sum + m.avgTime, 0) / pathsWithEdge.length;
+            // Normalize to 0-100 scale
+            const newWeight = Math.min(100, avgTime);
+            if (edge.weight !== newWeight) {
+                edge.weight = newWeight;
+                updated++;
+            }
+        }
+        console.log(`   Updated ${updated} edge weights`);
+    }
+    /**
+     * Check if path uses edge
+     */
+    pathUsesEdge(path, edge) {
+        for (let i = 0; i < path.length - 1; i++) {
+            if (path[i] === edge.from && path[i + 1] === edge.to) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Get training statistics
+     */
+    getStats() {
+        const successful = Array.from(this.metrics.values()).filter(m => !m.failed);
+        const failed = Array.from(this.metrics.values()).filter(m => m.failed);
+        const avgTime = successful.length > 0
+            ? successful.reduce((sum, m) => sum + m.avgTime, 0) / successful.length
+            : 0;
+        const fastest = successful.reduce((min, m) => (!min || m.avgTime < min.avgTime ? m : min), undefined);
+        const slowest = successful.reduce((max, m) => (!max || m.avgTime > max.avgTime ? m : max), undefined);
+        return {
+            total: this.metrics.size,
+            successful: successful.length,
+            failed: failed.length,
+            avgTime,
+            fastest,
+            slowest
+        };
+    }
+    /**
+     * Get metrics map
+     */
+    getMetrics() {
+        return this.metrics;
+    }
+}
+//# sourceMappingURL=GraphTrainer.js.map

package/dist/graph/GraphTrainer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTrainer.js","sourceRoot":"","sources":["../../src/graph/GraphTrainer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AAElD,MAAM,OAAO,YAAY;IACf,KAAK,CAAO;IACZ,QAAQ,CAAU;IAClB,OAAO,CAAY;IAE3B,YAAY,KAAY,EAAE,QAAkB;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAA;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,QAAmB;QAC7B,OAAO,CAAC,GAAG,CAAC,0BAA0B,QAAQ,CAAC,MAAM,iBAAiB,CAAC,CAAA;QAEvE,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,OAAO,CAAC,GAAG,CAAC,OAAO,KAAK,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;YAC1E,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAA;QACpC,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,CAAC,OAAO,CAAC,IAAI,eAAe,CAAC,CAAA;QAE1D,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY,CAAC,OAAgB;QACzC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,OAAO,CAAA;QAExC,iBAAiB;QACjB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAE3C,OAAO,CAAC,GAAG,CAAC,eAAe,KAAK,CAAC,MAAM,iBAAiB,CAAC,CAAA;QAEzD,sBAAsB;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CAAC,IAAc,EAAE,UAAgC;QAC1E,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAE9B,IAAI,CAAC;YACH,kBAAkB;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YAE/C,qCAAqC;YACrC,MAAM,UAAU,GAAG,CAAC,CAAA;YACpB,MAAM,KAAK,GAAa,EAAE,CAAA;YAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;gBAC/B,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;gBAClD,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAA;gBAC1C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACtB,CAAC;YAED,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;YAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;YAElC,gBAAgB;YAChB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE;oBACxB,IAAI;oBACJ,UAAU,EAAE,CAAC;oBACb,SAAS,EAAE,CAAC;oBACZ,QAAQ,EAAE,CAAC;oBACX,SAAS,EAAE,CAAC;oBACZ,OAAO,EAAE,CAAC;oBACV,OAAO,EAAE,QAAQ;oBACjB,OAAO,EAAE,CAAC;oBACV,IAAI,EAAE,IAAI;iBACX,CAAC,CAAA;YACJ,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAA;YACzC,MAAM,CAAC,UAAU,IAAI,UAAU,CAAA;YAC/B,MAAM,CAAC,SAAS,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,UAAU,CAAA;YACvD,MAAM,CAAC,SAAS,IAAI,OAAO,GAAG,UAAU,CAAA;YACxC,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,UAAU,CAAA;YACrD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAClD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAElD,OAAO,CAAC,GAAG,CAAC,WAAW,OAAO,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QAChE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,GAAG,CAAC,WAAW,OAAO,cAAe,GAAa,CAAC,OAAO,EAAE,CAAC,CAAA;YAErE,iBAAiB;YACjB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE;gBACxB,IAAI;gBACJ,UAAU,EAAE,CAAC;gBACb,SAAS,EAAE,CAAC;gBACZ,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,CAAC;gBACV,IAAI,EAAE,KAAK;gBACX,MAAM,EAAE,IAAI;gBACZ,KAAK,EAAG,GAAa,CAAC,OAAO;aAC9B,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,IAAc,EACd,UAAgC;QAEhC,yBAAyB;QACzB,IAAI,GAAG,GAAG,iBAAiB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;QACpC,MAAM,MAAM,GAAU,EAAE,CAAA;QAExB,YAAY;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YAElB,YAAY;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAA;YAEvE,IAAI,IAAI,EAAE,CAAC;gBACT,GAAG,IAAI,SAAS,EAAE,OAAO,IAAI,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,KAAK,CAAA;YACxD,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;YACnB,GAAG,IAAI,UAAU,IAAI,CAAC,CAAC,CAAC,UAAU,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAA;YACrD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;QAC5B,CAAC;QAED,mBAAmB;QACnB,GAAG,IAAI,YAAY,CAAA;QAEnB,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAA;IACxB,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,CAAC,GAAG,CAAC,+CAA+C,CAAC,CAAA;QAE5D,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACpC,iCAAiC;YACjC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC5D,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAClD,CAAA;YAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAQ;YAExC,sCAAsC;YACtC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAA;YAE3F,2BAA2B;YAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;YAExC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;gBACvB,OAAO,EAAE,CAAA;YACX,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,cAAc,OAAO,eAAe,CAAC,CAAA;IACnD,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAc,EAAE,IAAkC;QACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACH,QAAQ;QAQN,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QAC3E,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QAEtE,MAAM,OAAO,GACX,UAAU,CAAC,MAAM,GAAG,CAAC;YACnB,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM;YACvE,CAAC,CAAC,CAAC,CAAA;QAEP,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAC/B,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EACvD,SAAS,CACV,CAAA;QAED,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAC/B,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EACvD,SAAS,CACV,CAAA;QAED,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YACxB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,OAAO;YACP,OAAO;YACP,OAAO;SACR,CAAA;IACH,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;CACF"}

package/dist/http/LinkBuilder.d.ts

@@ -0,0 +1,82 @@
+/**
+ * LinkBuilder — Génère les liens HATEOAS depuis le graphe
+ *
+ * Logique pure, sans dépendance à Fastify.
+ * Prend un Trail + un Graph, retourne des liens navigables.
+ *
+ * Trois catégories de liens générés automatiquement :
+ *
+ *   self      — l'URL courante (Trail sérialisé)
+ *   up        — le parent (Trail sans la dernière frame)
+ *   relations — toutes les arêtes sortantes du nœud courant
+ *
+ * Les liens émergent du graphe — le dev ne configure rien.
+ */
+import type { Graph } from '../types/index.js';
+import { Trail } from '../navigation/Trail.js';
+export interface HateoasLink {
+    href: string;
+    method: 'GET' | 'POST' | 'PUT' | 'DELETE' | 'PATCH';
+    templated?: boolean;
+    title?: string;
+    rel?: string;
+}
+export interface HateoasLinks {
+    self: HateoasLink;
+    up?: HateoasLink;
+    [relation: string]: HateoasLink | undefined;
+}
+export interface LinkBuilderOptions {
+    /** Préfixe ajouté à toutes les URLs générées — ex: '/api/v1' */
+    prefix?: string;
+    /** Inclure les arêtes inverses (retour vers le parent) */
+    includeReverse?: boolean;
+    /** Exclure certaines relations — ex: ['internal', 'debug'] */
+    exclude?: string[];
+}
+export declare class LinkBuilder {
+    private graph;
+    private options;
+    constructor(graph: Graph, options?: LinkBuilderOptions);
+    /**
+     * Génère les liens HATEOAS pour un Trail donné.
+     *
+     * @example
+     * ```typescript
+     * const builder = new LinkBuilder(graph, { prefix: '/api' })
+     * const links   = builder.from(trail)
+     * // {
+     * //   self:    { href: '/api/people/Nolan/movies' },
+     * //   up:      { href: '/api/people/Nolan' },
+     * //   actors:  { href: '/api/people/Nolan/movies/{id}/actors', templated: true },
+     * //   ratings: { href: '/api/people/Nolan/movies/{id}/ratings', templated: true }
+     * // }
+     * ```
+     */
+    from(trail: Trail): HateoasLinks;
+    /**
+     * Génère les liens pour une collection de résultats.
+     * Chaque item reçoit ses propres liens self + relations.
+     *
+     * @example
+     * ```typescript
+     * // GET /people/Nolan/movies → liste de films
+     * const itemLinks = builder.forItems(trail, movies, 'id')
+     * // itemLinks[0] = { self: { href: '/people/Nolan/movies/1' }, actors: {...} }
+     * ```
+     */
+    forItems(trail: Trail, items: any[], idField?: string): HateoasLinks[];
+    /**
+     * Vérifie si une relation existe depuis un nœud donné.
+     * Utile pour les hooks d'access.check.
+     */
+    hasRelation(fromEntity: string, relation: string): boolean;
+    /**
+     * Retourne toutes les entités accessibles depuis un nœud.
+     */
+    reachableFrom(entity: string): string[];
+    private getOutgoingEdges;
+    private prefix;
+    private buildTitle;
+}
+//# sourceMappingURL=LinkBuilder.d.ts.map

package/dist/http/LinkBuilder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkBuilder.d.ts","sourceRoot":"","sources":["../../src/http/LinkBuilder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAa,MAAM,mBAAmB,CAAA;AACzD,OAAO,EAAE,KAAK,EAAE,MAAY,wBAAwB,CAAA;AAKpD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAM,MAAM,CAAA;IAChB,MAAM,EAAI,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAA;IACrD,SAAS,CAAC,EAAE,OAAO,CAAA;IACnB,KAAK,CAAC,EAAI,MAAM,CAAA;IAChB,GAAG,CAAC,EAAM,MAAM,CAAA;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAG,WAAW,CAAA;IAClB,EAAE,CAAC,EAAI,WAAW,CAAA;IAClB,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAAA;CAC5C;AAED,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,0DAA0D;IAC1D,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB,8DAA8D;IAC9D,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;CACnB;AAID,qBAAa,WAAW;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,OAAO,CAA8B;gBAEjC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,kBAAuB;IAS1D;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,YAAY;IAwFhC;;;;;;;;;;OAUG;IACH,QAAQ,CACN,KAAK,EAAI,KAAK,EACd,KAAK,EAAI,GAAG,EAAE,EACd,OAAO,GAAE,MAAa,GACrB,YAAY,EAAE;IAkBjB;;;OAGG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAM1D;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAMvC,OAAO,CAAC,gBAAgB;IAMxB,OAAO,CAAC,MAAM;IAKd,OAAO,CAAC,UAAU;CAkBnB"}