@linklabjs/core 0.1.0 → 0.1.2

package/dist/graph/GraphCompiler.js

@@ -0,0 +1,355 @@
+/**
+ * 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 { PathFinder } from '../core/PathFinder.js';
+export class GraphCompiler {
+    config;
+    constructor(config = {}) {
+        this.config = {
+            weightThreshold: config.weightThreshold ?? 1000,
+            minUsage: config.minUsage ?? 0,
+            keepFallbacks: config.keepFallbacks ?? true,
+            maxFallbacks: config.maxFallbacks ?? 2,
+            expose: config.expose ?? 'none'
+        };
+    }
+    compile(graph, metrics) {
+        console.log('🔧 Compiling optimized graph (v2 — physical + semantic)...\n');
+        const compiled = {
+            version: '2.0.0',
+            compiledAt: new Date().toISOString(),
+            config: this.config,
+            nodes: this.compileNodes(graph.nodes, this.config.expose),
+            routes: [],
+            stats: { totalPairs: 0, routesCompiled: 0, routesFiltered: 0, compressionRatio: '0%' }
+        };
+        // ── Nœuds réels (depuis les edges) ───────────────────────────────────────
+        const realNodes = new Set();
+        graph.edges.forEach(e => {
+            realNodes.add(e.from);
+            realNodes.add(e.to);
+        });
+        const nodeIds = Array.from(realNodes);
+        // ── 1. Routes physiques ───────────────────────────────────────────────────
+        const fkEdges = graph.edges.filter((e) => e.metadata?.type !== 'semantic_view' &&
+            e.metadata?.type !== 'virtual' &&
+            e.metadata?.type !== 'SEMANTIC');
+        const existingPairs = new Set(fkEdges.map((e) => `${e.from}→${e.to}`));
+        const inverseEdges = fkEdges
+            .filter((e) => !existingPairs.has(`${e.to}→${e.from}`))
+            .map((e) => ({
+            ...e,
+            from: e.to,
+            to: e.from,
+            name: `${e.name}_inv`,
+            metadata: { ...e.metadata, type: 'physical_reverse' }
+        }));
+        const physicalGraph = { ...graph, edges: [...fkEdges, ...inverseEdges] };
+        let kept = 0, filtered = 0;
+        const pairs = this.getAllPairs(nodeIds);
+        for (const { from, to } of pairs) {
+            const route = this.compilePath(from, to, physicalGraph, metrics);
+            if (route) {
+                compiled.routes.push(route);
+                kept++;
+            }
+            else {
+                filtered++;
+            }
+        }
+        // ── 2. Routes sémantiques ─────────────────────────────────────────────────
+        const semanticEdges = graph.edges.filter((e) => e.metadata?.type === 'semantic_view' && e.metadata?.condition != null);
+        let semanticKept = 0;
+        for (const edge of semanticEdges) {
+            const route = this.compileSemanticRoute(edge, graph);
+            if (route) {
+                compiled.routes.push(route);
+                semanticKept++;
+            }
+        }
+        // ── 2b. Routes virtuelles ─────────────────────────────────────────────────
+        const virtualEdges = graph.edges.filter((e) => e.metadata?.type === 'virtual');
+        let virtualKept = 0;
+        for (const edge of virtualEdges) {
+            const { from, to, via, name, weight } = edge;
+            if (!nodeIds.includes(from) || !nodeIds.includes(to))
+                continue;
+            const viaTable = via && nodeIds.includes(via) ? via : null;
+            const path = viaTable ? [from, viaTable, to] : [from, to];
+            const edges = viaTable
+                ? [
+                    { fromCol: 'id', toCol: 'id' },
+                    { fromCol: 'id', toCol: 'id' }
+                ]
+                : [{ fromCol: 'id', toCol: 'id' }];
+            compiled.routes.push({
+                from,
+                to,
+                semantic: false,
+                composed: false,
+                label: name ?? `virtual_${from}_${to}`,
+                virtual: true,
+                primary: {
+                    path,
+                    edges,
+                    weight: weight ?? 1,
+                    joins: path.length - 1,
+                    avgTime: weight ?? 1
+                },
+                fallbacks: [],
+                alternativesDiscarded: 0
+            });
+            virtualKept++;
+        }
+        // ── 3. Routes composées ───────────────────────────────────────────────────
+        const compiledSemRoutes = compiled.routes.filter((r) => r.semantic);
+        let composedKept = 0;
+        const semByFrom = new Map();
+        for (const r of compiledSemRoutes) {
+            if (!semByFrom.has(r.from))
+                semByFrom.set(r.from, []);
+            semByFrom.get(r.from).push(r);
+        }
+        for (const [entityId, outRoutes] of semByFrom) {
+            const inRoutes = compiledSemRoutes.filter((r) => r.to === entityId);
+            if (!inRoutes.length)
+                continue;
+            for (const rOut of outRoutes) {
+                const pivot = rOut.to;
+                const matchingIn = inRoutes.filter((r) => r.from === pivot);
+                for (const rIn of matchingIn) {
+                    if (rOut.label === rIn.label)
+                        continue;
+                    const composedLabel = `${rOut.label}→${rIn.label}`;
+                    const composedWeight = rOut.primary.weight + rIn.primary.weight;
+                    const composedPath = [...rOut.primary.path, ...rIn.primary.path.slice(1)];
+                    const composedEdges = [...rOut.primary.edges, ...rIn.primary.edges];
+                    const metricKey = `composed:${entityId}→${entityId}:${composedLabel}`;
+                    const metric = metrics.get(metricKey);
+                    if (metrics.size > 0) {
+                        if (!metric)
+                            continue;
+                        const w = metric.avgTime ?? composedWeight;
+                        if (!metric.used || w > this.config.weightThreshold)
+                            continue;
+                    }
+                    compiled.routes.push({
+                        from: entityId,
+                        to: entityId,
+                        semantic: true,
+                        composed: true,
+                        label: composedLabel,
+                        primary: {
+                            path: composedPath,
+                            edges: composedEdges,
+                            weight: composedWeight,
+                            joins: composedPath.length - 1,
+                            avgTime: composedWeight
+                        },
+                        fallbacks: [],
+                        alternativesDiscarded: 0
+                    });
+                    composedKept++;
+                }
+            }
+        }
+        compiled.stats = {
+            totalPairs: pairs.length,
+            routesCompiled: kept + semanticKept + virtualKept + composedKept,
+            routesFiltered: filtered,
+            compressionRatio: '—'
+        };
+        console.log('\n✅ Compilation complete:');
+        console.log(`   Physical routes:  ${kept}`);
+        console.log(`   Semantic routes:  ${semanticKept}`);
+        console.log(`   Composed routes:  ${composedKept}`);
+        console.log(`   Filtered:         ${filtered}`);
+        return compiled;
+    }
+    // ── Compile exposed flag sur chaque node ────────────────────────────────────
+    compileNodes(nodes, expose) {
+        return nodes.map(node => {
+            let exposed;
+            if (expose === 'all') {
+                exposed = true;
+            }
+            else if (expose === 'none') {
+                exposed = false;
+            }
+            else if ('include' in expose) {
+                exposed = expose.include.includes(node.id);
+            }
+            else {
+                exposed = !expose.exclude.includes(node.id);
+            }
+            return { ...node, exposed };
+        });
+    }
+    // ── Route sémantique ─────────────────────────────────────────────────────────
+    compileSemanticRoute(edge, graph) {
+        const { from, to, via, metadata } = edge;
+        const condition = metadata.condition ?? {};
+        const label = edge.name ?? metadata.label ?? 'view';
+        const e1Raw = graph.edges.find((e) => ((e.from === from && e.to === via) || (e.from === via && e.to === from)) &&
+            (e.metadata?.type === 'physical' || e.metadata?.type === 'physical_reverse'));
+        const e2Raw = graph.edges.find((e) => ((e.from === via && e.to === to) || (e.from === to && e.to === via)) &&
+            (e.metadata?.type === 'physical' || e.metadata?.type === 'physical_reverse'));
+        if (!e1Raw || !e2Raw)
+            return null;
+        const e1IsReversed = e1Raw.from === via;
+        const e1 = {
+            fromCol: e1IsReversed ? 'id' : (e1Raw.via ?? 'id'),
+            toCol: e1IsReversed ? (e1Raw.via ?? 'id') : 'id',
+            condition,
+            label
+        };
+        const e2IsReversed = e2Raw.from === to;
+        const e2 = {
+            fromCol: e2IsReversed ? 'id' : (e2Raw.via ?? 'id'),
+            toCol: e2IsReversed ? (e2Raw.via ?? 'id') : 'id'
+        };
+        return {
+            from,
+            to,
+            semantic: true,
+            label,
+            primary: {
+                path: [from, via, to],
+                edges: [e1, e2],
+                weight: edge.weight ?? 0.8,
+                joins: 2,
+                avgTime: edge.weight ?? 0.8
+            },
+            fallbacks: [],
+            alternativesDiscarded: 0
+        };
+    }
+    // ── Routes physiques ──────────────────────────────────────────────────────────
+    getAllPairs(nodeIds) {
+        const pairs = [];
+        for (const from of nodeIds)
+            for (const to of nodeIds)
+                if (from !== to)
+                    pairs.push({ from, to });
+        return pairs;
+    }
+    compilePath(from, to, graph, metrics) {
+        const finder = new PathFinder(graph);
+        const allPaths = finder.findAllPaths(from, to, 5);
+        if (!allPaths.length)
+            return null;
+        const pathsWithMetrics = allPaths.map(path => {
+            const key = path.join('→');
+            const metric = metrics.get(key);
+            let w = 0;
+            for (let i = 0; i < path.length - 1; i++) {
+                const ee = graph.edges.filter(e => (e.from === path[i] && e.to === path[i + 1]) ||
+                    (e.from === path[i + 1] && e.to === path[i]));
+                const ws = ee.map(e => Number(e.weight)).filter(x => !isNaN(x));
+                w += ws.length ? Math.min(...ws) : 1;
+            }
+            const finalWeight = metric && !isNaN(metric.avgTime) ? metric.avgTime : w;
+            return {
+                path,
+                key,
+                weight: finalWeight,
+                failed: metric?.failed === true,
+                used: metric ? metric.used : true
+            };
+        });
+        const valid = pathsWithMetrics
+            .filter(p => !p.failed && p.used !== false)
+            .filter(p => !isNaN(p.weight) && p.weight <= this.config.weightThreshold)
+            .sort((a, b) => a.weight - b.weight);
+        if (!valid.length)
+            return null;
+        const unique = [];
+        const seen = new Set();
+        for (const p of valid) {
+            if (!seen.has(p.key)) {
+                unique.push(p);
+                seen.add(p.key);
+            }
+        }
+        const best = unique[0];
+        const fallbacks = this.config.keepFallbacks ? unique.slice(1, this.config.maxFallbacks + 1) : [];
+        const primaryEdges = this.resolveEdges(best.path, graph);
+        if (!primaryEdges)
+            return null;
+        return {
+            from,
+            to,
+            primary: {
+                path: best.path,
+                edges: primaryEdges,
+                weight: best.weight,
+                joins: best.path.length - 1,
+                avgTime: best.weight
+            },
+            fallbacks: fallbacks
+                .map(fb => {
+                const ee = this.resolveEdges(fb.path, graph);
+                if (!ee)
+                    return null;
+                return {
+                    path: fb.path,
+                    edges: ee,
+                    weight: fb.weight,
+                    joins: fb.path.length - 1,
+                    avgTime: fb.weight
+                };
+            })
+                .filter((fb) => fb !== null),
+            alternativesDiscarded: unique.length - 1 - fallbacks.length
+        };
+    }
+    resolveEdges(path, graph) {
+        const result = [];
+        const nodeNames = new Set(graph.nodes.map((n) => n.id));
+        for (let i = 0; i < path.length - 1; i++) {
+            const from = path[i], to = path[i + 1];
+            const edgeDirect = graph.edges.find((e) => e.from === from && e.to === to);
+            const edgeReverse = graph.edges.find((e) => e.from === to && e.to === from);
+            const edge = edgeDirect ?? edgeReverse;
+            const isReversed = !edgeDirect && !!edgeReverse;
+            if (!edge) {
+                result.push({ fromCol: 'id', toCol: `${from.toLowerCase()}Id` });
+                continue;
+            }
+            if (edge.metadata?.type === 'semantic_view' && nodeNames.has(edge.via))
+                return null;
+            const flipCols = edge.metadata?.type === 'physical_reverse' || isReversed;
+            result.push({
+                fromCol: flipCols ? 'id' : edge.via || 'id',
+                toCol: flipCols ? edge.via || 'id' : 'id'
+            });
+        }
+        return result;
+    }
+    static getStats(compiled) {
+        const routes = compiled.routes;
+        const semantic = routes.filter(r => r.semantic && !r.composed).length;
+        const composed = routes.filter(r => r.composed).length;
+        const physical = routes.length - semantic - composed;
+        if (!routes.length)
+            return { totalRoutes: 0, fallbackRatio: '0%', semantic: 0, physical: 0, composed: 0 };
+        const withFallbacks = routes.filter(r => r.fallbacks.length > 0).length;
+        return {
+            totalRoutes: routes.length,
+            physical,
+            semantic,
+            composed,
+            fallbackRatio: ((withFallbacks / routes.length) * 100).toFixed(1) + '%'
+        };
+    }
+}
+//# sourceMappingURL=GraphCompiler.js.map

package/dist/graph/GraphCompiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphCompiler.js","sourceRoot":"","sources":["../../src/graph/GraphCompiler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AASlD,MAAM,OAAO,aAAa;IAChB,MAAM,CAAqE;IAEnF,YAAY,SAAkC,EAAE;QAC9C,IAAI,CAAC,MAAM,GAAG;YACZ,eAAe,EAAE,MAAM,CAAC,eAAe,IAAI,IAAI;YAC/C,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,CAAC;YAC9B,aAAa,EAAE,MAAM,CAAC,aAAa,IAAI,IAAI;YAC3C,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,CAAC;YACtC,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,MAAM;SAChC,CAAA;IACH,CAAC;IAED,OAAO,CAAC,KAAY,EAAE,OAAmB;QACvC,OAAO,CAAC,GAAG,CAAC,8DAA8D,CAAC,CAAA;QAE3E,MAAM,QAAQ,GAAkB;YAC9B,OAAO,EAAE,OAAO;YAChB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACpC,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YACzD,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,IAAI,EAAE;SACvF,CAAA;QAED,4EAA4E;QAC5E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;QACnC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACtB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACrB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QACrB,CAAC,CAAC,CAAA;QACF,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAErC,6EAA6E;QAC7E,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAChC,CAAC,CAAM,EAAE,EAAE,CACT,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,eAAe;YACpC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,SAAS;YAC9B,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,UAAU,CAClC,CAAA;QACD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QAC3E,MAAM,YAAY,GAAG,OAAO;aACzB,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;aAC3D,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;YAChB,GAAG,CAAC;YACJ,IAAI,EAAE,CAAC,CAAC,EAAE;YACV,EAAE,EAAE,CAAC,CAAC,IAAI;YACV,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,MAAM;YACrB,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE;SACtD,CAAC,CAAC,CAAA;QACL,MAAM,aAAa,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,YAAY,CAAC,EAAE,CAAA;QAExE,IAAI,IAAI,GAAG,CAAC,EACV,QAAQ,GAAG,CAAC,CAAA;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;QAEvC,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;YAChE,IAAI,KAAK,EAAE,CAAC;gBACV,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAY,CAAC,CAAA;gBAClC,IAAI,EAAE,CAAA;YACR,CAAC;iBAAM,CAAC;gBACN,QAAQ,EAAE,CAAA;YACZ,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACtC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,eAAe,IAAI,CAAC,CAAC,QAAQ,EAAE,SAAS,IAAI,IAAI,CAClF,CAAA;QAED,IAAI,YAAY,GAAG,CAAC,CAAA;QACpB,KAAK,MAAM,IAAI,IAAI,aAAsB,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YACpD,IAAI,KAAK,EAAE,CAAC;gBACV,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAY,CAAC,CAAA;gBAClC,YAAY,EAAE,CAAA;YAChB,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,SAAS,CAAC,CAAA;QAEnF,IAAI,WAAW,GAAG,CAAC,CAAA;QACnB,KAAK,MAAM,IAAI,IAAI,YAAqB,EAAE,CAAC;YACzC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAW,CAAA;YACnD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,SAAQ;YAE9D,MAAM,QAAQ,GAAG,GAAG,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAA;YAC1D,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YACzD,MAAM,KAAK,GAAG,QAAQ;gBACpB,CAAC,CAAC;oBACE,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;oBAC9B,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;iBAC/B;gBACH,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;YAEpC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;gBACnB,IAAI;gBACJ,EAAE;gBACF,QAAQ,EAAE,KAAK;gBACf,QAAQ,EAAE,KAAK;gBACf,KAAK,EAAE,IAAI,IAAI,WAAW,IAAI,IAAI,EAAE,EAAE;gBACtC,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP,IAAI;oBACJ,KAAK;oBACL,MAAM,EAAE,MAAM,IAAI,CAAC;oBACnB,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;oBACtB,OAAO,EAAE,MAAM,IAAI,CAAC;iBACrB;gBACD,SAAS,EAAE,EAAE;gBACb,qBAAqB,EAAE,CAAC;aAClB,CAAC,CAAA;YACT,WAAW,EAAE,CAAA;QACf,CAAC;QAED,6EAA6E;QAC7E,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAU,CAAA;QACjF,IAAI,YAAY,GAAG,CAAC,CAAA;QAEpB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAA;QAC1C,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YACrD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;QAED,KAAK,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;YAC9C,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAA;YACxE,IAAI,CAAC,QAAQ,CAAC,MAAM;gBAAE,SAAQ;YAE9B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAA;gBACrB,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAA;gBAEhE,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;oBAC7B,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;wBAAE,SAAQ;oBAEtC,MAAM,aAAa,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,EAAE,CAAA;oBAClD,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAA;oBAC/D,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;oBACzE,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;oBAEnE,MAAM,SAAS,GAAG,YAAY,QAAQ,IAAI,QAAQ,IAAI,aAAa,EAAE,CAAA;oBACrE,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBACrC,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;wBACrB,IAAI,CAAC,MAAM;4BAAE,SAAQ;wBACrB,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,IAAI,cAAc,CAAA;wBAC1C,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe;4BAAE,SAAQ;oBAC/D,CAAC;oBAED,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;wBACnB,IAAI,EAAE,QAAQ;wBACd,EAAE,EAAE,QAAQ;wBACZ,QAAQ,EAAE,IAAI;wBACd,QAAQ,EAAE,IAAI;wBACd,KAAK,EAAE,aAAa;wBACpB,OAAO,EAAE;4BACP,IAAI,EAAE,YAAY;4BAClB,KAAK,EAAE,aAAa;4BACpB,MAAM,EAAE,cAAc;4BACtB,KAAK,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC;4BAC9B,OAAO,EAAE,cAAc;yBACxB;wBACD,SAAS,EAAE,EAAE;wBACb,qBAAqB,EAAE,CAAC;qBAClB,CAAC,CAAA;oBACT,YAAY,EAAE,CAAA;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,KAAK,GAAG;YACf,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,cAAc,EAAE,IAAI,GAAG,YAAY,GAAG,WAAW,GAAG,YAAY;YAChE,cAAc,EAAE,QAAQ;YACxB,gBAAgB,EAAE,GAAG;SACtB,CAAA;QAED,OAAO,CAAC,GAAG,CAAC,2BAA2B,CAAC,CAAA;QACxC,OAAO,CAAC,GAAG,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC3C,OAAO,CAAC,GAAG,CAAC,wBAAwB,YAAY,EAAE,CAAC,CAAA;QACnD,OAAO,CAAC,GAAG,CAAC,wBAAwB,YAAY,EAAE,CAAC,CAAA;QACnD,OAAO,CAAC,GAAG,CAAC,wBAAwB,QAAQ,EAAE,CAAC,CAAA;QAE/C,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,+EAA+E;IAEvE,YAAY,CAAC,KAAkB,EAAE,MAAoB;QAC3D,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACtB,IAAI,OAAgB,CAAA;YAEpB,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC;iBAAM,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;gBAC7B,OAAO,GAAG,KAAK,CAAA;YACjB,CAAC;iBAAM,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;gBAC/B,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5C,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC7C,CAAC;YAED,OAAO,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAA;QAC7B,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,gFAAgF;IAExE,oBAAoB,CAAC,IAAS,EAAE,KAAY;QAClD,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QACxC,MAAM,SAAS,GAA4B,QAAQ,CAAC,SAAS,IAAI,EAAE,CAAA;QACnE,MAAM,KAAK,GAAW,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAA;QAE3D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAM,EAAE,EAAE,CACT,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;YACxE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,kBAAkB,CAAC,CAC/E,CAAA;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAM,EAAE,EAAE,CACT,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,kBAAkB,CAAC,CAC/E,CAAA;QAED,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAA;QAEjC,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,KAAK,GAAG,CAAA;QACvC,MAAM,EAAE,GAAiB;YACvB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC;YAClD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;YAChD,SAAS;YACT,KAAK;SACN,CAAA;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,KAAK,EAAE,CAAA;QACtC,MAAM,EAAE,GAAiB;YACvB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC;YAClD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;SACjD,CAAA;QAED,OAAO;YACL,IAAI;YACJ,EAAE;YACF,QAAQ,EAAE,IAAI;YACd,KAAK;YACL,OAAO,EAAE;gBACP,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;gBACrB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;gBAC1B,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;aAC5B;YACD,SAAS,EAAE,EAAE;YACb,qBAAqB,EAAE,CAAC;SACzB,CAAA;IACH,CAAC;IAED,iFAAiF;IAEzE,WAAW,CAAC,OAAiB;QACnC,MAAM,KAAK,GAAwC,EAAE,CAAA;QACrD,KAAK,MAAM,IAAI,IAAI,OAAO;YAAE,KAAK,MAAM,EAAE,IAAI,OAAO;gBAAE,IAAI,IAAI,KAAK,EAAE;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;QAC/F,OAAO,KAAK,CAAA;IACd,CAAC;IAEO,WAAW,CAAC,IAAY,EAAE,EAAU,EAAE,KAAY,EAAE,OAAmB;QAC7E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QACjD,IAAI,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO,IAAI,CAAA;QAEjC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC/B,IAAI,CAAC,GAAG,CAAC,CAAA;YACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,CACF,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5C,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAC/C,CAAA;gBACD,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC/D,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACtC,CAAC;YACD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;YACzE,OAAO;gBACL,IAAI;gBACJ,GAAG;gBACH,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,IAAI;gBAC/B,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;aAClC,CAAA;QACH,CAAC,CAAC,CAAA;QAEF,MAAM,KAAK,GAAG,gBAAgB;aAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;aACxE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;QAEtC,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,IAAI,CAAA;QAE9B,MAAM,MAAM,GAAiB,EAAE,CAAA;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACjB,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAEhG,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACxD,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAA;QAE9B,OAAO;YACL,IAAI;YACJ,EAAE;YACF,OAAO,EAAE;gBACP,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,KAAK,EAAE,YAAY;gBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;gBAC3B,OAAO,EAAE,IAAI,CAAC,MAAM;aACrB;YACD,SAAS,EAAE,SAAS;iBACjB,GAAG,CAAC,EAAE,CAAC,EAAE;gBACR,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC5C,IAAI,CAAC,EAAE;oBAAE,OAAO,IAAI,CAAA;gBACpB,OAAO;oBACL,IAAI,EAAE,EAAE,CAAC,IAAI;oBACb,KAAK,EAAE,EAAE;oBACT,MAAM,EAAE,EAAE,CAAC,MAAM;oBACjB,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;oBACzB,OAAO,EAAE,EAAE,CAAC,MAAM;iBACnB,CAAA;YACH,CAAC,CAAC;iBACD,MAAM,CAAC,CAAC,EAAE,EAAgC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC;YAC5D,qBAAqB,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM;SAC5D,CAAA;IACH,CAAC;IAEO,YAAY,CAAC,IAAc,EAAE,KAAU;QAC7C,MAAM,MAAM,GAAmB,EAAE,CAAA;QACjC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAClB,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAClB,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAA;YAC/E,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;YAChF,MAAM,IAAI,GAAG,UAAU,IAAI,WAAW,CAAA;YACtC,MAAM,UAAU,GAAG,CAAC,UAAU,IAAI,CAAC,CAAC,WAAW,CAAA;YAE/C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAA;gBAChE,SAAQ;YACV,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,KAAK,eAAe,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAA;YAEnF,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,KAAK,kBAAkB,IAAI,UAAU,CAAA;YACzE,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;gBAC3C,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI;aAC1C,CAAC,CAAA;QACJ,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,QAAuB;QACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAe,CAAA;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;QACrE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;QACtD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;QACpD,IAAI,CAAC,MAAM,CAAC,MAAM;YAChB,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;QACvF,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAA;QACvE,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,MAAM;YAC1B,QAAQ;YACR,QAAQ;YACR,QAAQ;YACR,aAAa,EAAE,CAAC,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG;SACxE,CAAA;IACH,CAAC;CACF"}

package/dist/graph/GraphExtractor.d.ts

@@ -0,0 +1,21 @@
+import type { Graph, Provider, ActionRegistry } from '../types/index.js';
+export declare class GraphExtractor {
+    private provider;
+    private actionRegistry?;
+    constructor(provider: Provider, actionRegistry?: ActionRegistry);
+    /**
+     * Extrait le graphe complet : Tables + Actions + Relations
+     */
+    extract(): Promise<Graph>;
+    private getTables;
+    private getColumns;
+    private getRowCount;
+    private getForeignKeys;
+    /**
+     * Calcul du poids initial (Physique de la donnée)
+     * On utilise le logarithme de la taille pour ne pas pénaliser trop lourdement
+     * les grosses tables, mais garder une notion de "frais de déplacement".
+     */
+    private calculateInitialWeight;
+}
+//# sourceMappingURL=GraphExtractor.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExtractor.d.ts","sourceRoot":"","sources":["../../src/graph/GraphExtractor.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,KAAK,EAGL,QAAQ,EAER,cAAc,EACf,MAAM,mBAAmB,CAAA;AAe1B,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,cAAc,CAAC,CAAgB;gBAE3B,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,EAAE,cAAc;IAK/D;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC;YAmDjB,SAAS;YAgCT,UAAU;YA0BV,WAAW;YAUX,cAAc;IAwB5B;;;;OAIG;IACH,OAAO,CAAC,sBAAsB;CAO/B"}

package/dist/graph/GraphExtractor.js

@@ -0,0 +1,145 @@
+import fs from 'fs';
+export class GraphExtractor {
+    provider;
+    actionRegistry;
+    constructor(provider, actionRegistry) {
+        this.provider = provider;
+        this.actionRegistry = actionRegistry;
+    }
+    /**
+     * Extrait le graphe complet : Tables + Actions + Relations
+     */
+    async extract() {
+        console.log('📊 LinkLab : Extraction du graphe sémantique...');
+        // 1. Extraction des tables et leurs métadonnées
+        const tables = await this.getTables();
+        console.log(`   Found ${tables.length} tables`);
+        // 2. Extraction des clés étrangères (Relations natives)
+        const foreignKeys = await this.getForeignKeys();
+        console.log(`   Found ${foreignKeys.length} foreign keys`);
+        // 3. Construction des Nœuds (Tables)
+        const nodes = tables.map(t => ({
+            id: t.name,
+            type: 'table',
+            columns: t.columns,
+            rowCount: t.rowCount,
+            description: t.description || ''
+        }));
+        // 4. Injection des Nœuds (Actions) - Si présentes dans le registre
+        if (this.actionRegistry) {
+            const actions = this.actionRegistry.getAll();
+            actions.forEach(action => {
+                nodes.push({
+                    id: action.id,
+                    type: 'action',
+                    description: action.description || 'Action système',
+                    params: action.requiredParams
+                });
+            });
+        }
+        // 5. Construction des Edges (Liaisons)
+        const edges = foreignKeys.map(fk => ({
+            name: `rel_${fk.fromTable}_${fk.toTable}`,
+            from: fk.fromTable,
+            to: fk.toTable,
+            via: fk.column,
+            type: 'foreign_key',
+            weight: this.calculateInitialWeight(fk, tables)
+        }));
+        const graph = { nodes, edges };
+        console.log('✅ Graphe LinkLab extrait avec succès');
+        fs.writeFileSync('./graph.json', JSON.stringify(graph, null, 2));
+        return graph;
+    }
+    async getTables() {
+        // On récupère aussi la description de la table (COMMENT ON TABLE)
+        const query = `
+      SELECT
+        t.table_name as name,
+        obj_description(pgc.oid, 'pg_class') as description
+      FROM information_schema.tables t
+      JOIN pg_class pgc ON t.table_name = pgc.relname
+      JOIN pg_namespace pgn ON pgc.relnamespace = pgn.oid
+      WHERE t.table_schema = 'public'
+        AND t.table_type = 'BASE TABLE'
+        AND pgn.nspname = 'public'
+    `;
+        const result = await this.provider.query(query);
+        const tables = [];
+        for (const table of result) {
+            const columns = await this.getColumns(table.name);
+            const rowCount = await this.getRowCount(table.name);
+            tables.push({
+                name: table.name,
+                columns,
+                rowCount,
+                description: table.description
+            });
+        }
+        return tables;
+    }
+    async getColumns(tableName) {
+        // Récupère les colonnes ET leurs descriptions (COMMENT ON COLUMN)
+        const query = `
+      SELECT
+        cols.column_name,
+        cols.data_type,
+        (SELECT pg_catalog.col_description(c.oid, cols.ordinal_position::int)
+         FROM pg_catalog.pg_class c
+         WHERE c.relname = cols.table_name) as description
+      FROM information_schema.columns cols
+      WHERE table_name = $1
+    `;
+        const result = await this.provider.query(query, [tableName]);
+        return result.map(c => ({
+            name: c.column_name,
+            type: c.data_type,
+            description: c.description || ''
+        }));
+    }
+    async getRowCount(tableName) {
+        try {
+            const query = `SELECT reltuples::bigint as count FROM pg_class WHERE relname = $1`;
+            const result = await this.provider.query(query, [tableName]);
+            return parseInt(result[0]?.count || '0', 10);
+        }
+        catch {
+            return 0;
+        }
+    }
+    async getForeignKeys() {
+        const query = `
+      SELECT
+        tc.table_name as from_table,
+        kcu.column_name as column,
+        ccu.table_name as to_table,
+        -- Vérifie si la colonne est unique ou PK pour la cardinalité
+        (SELECT COUNT(*)
+         FROM information_schema.table_constraints i_tc
+         JOIN information_schema.key_column_usage i_kcu
+           ON i_tc.constraint_name = i_kcu.constraint_name
+         WHERE i_tc.table_name = tc.table_name
+           AND i_kcu.column_name = kcu.column_name
+           AND (i_tc.constraint_type = 'PRIMARY KEY' OR i_tc.constraint_type = 'UNIQUE')
+        ) > 0 as is_unique
+      FROM information_schema.table_constraints tc
+      JOIN information_schema.key_column_usage kcu ON tc.constraint_name = kcu.constraint_name
+      JOIN information_schema.constraint_column_usage ccu ON tc.constraint_name = ccu.constraint_name
+      WHERE tc.constraint_type = 'FOREIGN KEY'
+    `;
+        return await this.provider.query(query);
+    }
+    /**
+     * Calcul du poids initial (Physique de la donnée)
+     * On utilise le logarithme de la taille pour ne pas pénaliser trop lourdement
+     * les grosses tables, mais garder une notion de "frais de déplacement".
+     */
+    calculateInitialWeight(fk, tables) {
+        const targetTable = tables.find(t => t.name === fk.toTable);
+        if (!targetTable || targetTable.rowCount <= 0)
+            return 1;
+        // Formule : 1 + log10(n) -> 100 lignes = poids 3, 1M lignes = poids 7.
+        return 1 + Math.log10(targetTable.rowCount);
+    }
+}
+//# sourceMappingURL=GraphExtractor.js.map

package/dist/graph/GraphExtractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExtractor.js","sourceRoot":"","sources":["../../src/graph/GraphExtractor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,IAAI,CAAA;AAuBnB,MAAM,OAAO,cAAc;IACjB,QAAQ,CAAU;IAClB,cAAc,CAAiB;IAEvC,YAAY,QAAkB,EAAE,cAA+B;QAC7D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAA;IACtC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,OAAO,CAAC,GAAG,CAAC,iDAAiD,CAAC,CAAA;QAE9D,gDAAgD;QAChD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACrC,OAAO,CAAC,GAAG,CAAC,YAAY,MAAM,CAAC,MAAM,SAAS,CAAC,CAAA;QAE/C,wDAAwD;QACxD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE,CAAA;QAC/C,OAAO,CAAC,GAAG,CAAC,YAAY,WAAW,CAAC,MAAM,eAAe,CAAC,CAAA;QAE1D,qCAAqC;QACrC,MAAM,KAAK,GAAgB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1C,EAAE,EAAE,CAAC,CAAC,IAAI;YACV,IAAI,EAAE,OAAgB;YACtB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,WAAW,EAAE,CAAC,CAAC,WAAW,IAAI,EAAE;SACjC,CAAC,CAAC,CAAA;QAEH,mEAAmE;QACnE,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAA;YAC5C,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBACvB,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,IAAI,EAAE,QAAiB;oBACvB,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,gBAAgB;oBACnD,MAAM,EAAE,MAAM,CAAC,cAAc;iBAC9B,CAAC,CAAA;YACJ,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,uCAAuC;QACvC,MAAM,KAAK,GAAgB,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAChD,IAAI,EAAE,OAAO,EAAE,CAAC,SAAS,IAAI,EAAE,CAAC,OAAO,EAAE;YACzC,IAAI,EAAE,EAAE,CAAC,SAAS;YAClB,EAAE,EAAE,EAAE,CAAC,OAAO;YACd,GAAG,EAAE,EAAE,CAAC,MAAM;YACd,IAAI,EAAE,aAAsB;YAC5B,MAAM,EAAE,IAAI,CAAC,sBAAsB,CAAC,EAAE,EAAE,MAAM,CAAC;SAChD,CAAC,CAAC,CAAA;QAEH,MAAM,KAAK,GAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;QAErC,OAAO,CAAC,GAAG,CAAC,sCAAsC,CAAC,CAAA;QACnD,EAAE,CAAC,aAAa,CAAC,cAAc,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QAEhE,OAAO,KAAK,CAAA;IACd,CAAC;IAEO,KAAK,CAAC,SAAS;QACrB,kEAAkE;QAClE,MAAM,KAAK,GAAG;;;;;;;;;;KAUb,CAAA;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAwC,KAAK,CAAC,CAAA;QACtF,MAAM,MAAM,GAAgB,EAAE,CAAA;QAE9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACjD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAEnD,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,OAAO;gBACP,QAAQ;gBACR,WAAW,EAAE,KAAK,CAAC,WAAW;aAC/B,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAEO,KAAK,CAAC,UAAU,CAAC,SAAiB;QACxC,kEAAkE;QAClE,MAAM,KAAK,GAAG;;;;;;;;;KASb,CAAA;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAIrC,KAAK,EAAE,CAAC,SAAS,CAAC,CAAC,CAAA;QAEtB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,EAAE,CAAC,CAAC,WAAW;YACnB,IAAI,EAAE,CAAC,CAAC,SAAS;YACjB,WAAW,EAAE,CAAC,CAAC,WAAW,IAAI,EAAE;SACjC,CAAC,CAAC,CAAA;IACL,CAAC;IAEO,KAAK,CAAC,WAAW,CAAC,SAAiB;QACzC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,oEAAoE,CAAA;YAClF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAoB,KAAK,EAAE,CAAC,SAAS,CAAC,CAAC,CAAA;YAC/E,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,GAAG,EAAE,EAAE,CAAC,CAAA;QAC9C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,cAAc;QAC1B,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;;;;KAkBb,CAAA;QAED,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACzC,CAAC;IAED;;;;OAIG;IACK,sBAAsB,CAAC,EAAkB,EAAE,MAAmB;QACpE,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,OAAO,CAAC,CAAA;QAC3D,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,QAAQ,IAAI,CAAC;YAAE,OAAO,CAAC,CAAA;QAEvD,uEAAuE;QACvE,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;IAC7C,CAAC;CACF"}

package/dist/graph/GraphOptimizer.d.ts

@@ -0,0 +1,104 @@
+/**
+ * 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 type { Graph } from '../types/index.js';
+export type CycleType = 'SELF_LOOP' | 'BIDIRECTIONAL' | 'STRUCTURAL_CYCLE';
+export type WarningSeverity = 'INFO' | 'WARNING';
+export interface CycleWarning {
+    type: CycleType;
+    severity: WarningSeverity;
+    edges: string[];
+    nodes: string[];
+    note: string;
+}
+export interface DuplicatePathWarning {
+    from: string;
+    to: string;
+    paths: string[][];
+    note: string;
+}
+export interface GraphOptimizationReport {
+    graph: Graph;
+    summary: {
+        nodes: {
+            before: number;
+            after: number;
+            removed: number;
+        };
+        edges: {
+            before: number;
+            after: number;
+            removed: number;
+        };
+    };
+    cycles: CycleWarning[];
+    duplicatePaths: DuplicatePathWarning[];
+    removedOrphans: string[];
+    removedDeadEnds: string[];
+    isClean: boolean;
+}
+export interface GraphOptimizerConfig {
+    /**
+     * Types de relations bidirectionnelles considérés comme intentionnels (INFO, pas WARNING).
+     * Ex: ['DIRECT', 'TRANSFER', 'physical_reverse', 'INFLUENCE']
+     * Par défaut : ['physical_reverse'] — les inverses FK sont toujours intentionnels.
+     */
+    intentionalBidirectional?: string[];
+    /**
+     * Types de self-loops considérés comme intentionnels (INFO, pas WARNING).
+     * Ex: ['TRANSFER'] — les correspondances métro sont des self-loops normaux.
+     * Par défaut : [] — tout self-loop est signalé.
+     */
+    intentionalSelfLoops?: string[];
+}
+export declare class GraphOptimizer {
+    private graph;
+    private config;
+    constructor(graph: Graph, config?: GraphOptimizerConfig);
+    /**
+     * Pipeline complet — retourne un rapport, ne modifie pas le graphe original.
+     * Seuls orphelins et dead-ends stricts sont supprimés (safe).
+     */
+    optimize(): GraphOptimizationReport;
+    /**
+     * Détecte et classifie les cycles — ne supprime rien.
+     */
+    private detectCycles;
+    /**
+     * Détecte les cycles structurels A → B → ... → A
+     * en ne suivant que les arêtes du même type.
+     */
+    private detectStructuralCycles;
+    /**
+     * Supprime les nœuds sans aucune arête (entrante ou sortante).
+     * Inoffensif — un nœud isolé ne contribue à aucune traversée.
+     */
+    private removeOrphans;
+    /**
+     * 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.
+     */
+    private removeStrictDeadEnds;
+    /**
+     * Détecte les paires de nœuds avec plusieurs chemins possibles.
+     * Informatif — les chemins multiples sont souvent intentionnels (fallbacks).
+     */
+    private detectDuplicatePaths;
+    private printReport;
+}
+//# sourceMappingURL=GraphOptimizer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GraphOptimizer.d.ts","sourceRoot":"","sources":["../../src/graph/GraphOptimizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAwB,MAAM,mBAAmB,CAAA;AAKpE,MAAM,MAAM,SAAS,GAAG,WAAW,GAAG,eAAe,GAAG,kBAAkB,CAAA;AAC1E,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,SAAS,CAAA;AAEhD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,SAAS,CAAA;IACf,QAAQ,EAAE,eAAe,CAAA;IACzB,KAAK,EAAE,MAAM,EAAE,CAAA;IACf,KAAK,EAAE,MAAM,EAAE,CAAA;IACf,IAAI,EAAE,MAAM,CAAA;CACb;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,EAAE,EAAE,CAAA;IACjB,IAAI,EAAE,MAAM,CAAA;CACb;AAED,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,KAAK,CAAA;IACZ,OAAO,EAAE;QACP,KAAK,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAA;QACzD,KAAK,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAA;KAC1D,CAAA;IACD,MAAM,EAAE,YAAY,EAAE,CAAA;IACtB,cAAc,EAAE,oBAAoB,EAAE,CAAA;IACtC,cAAc,EAAE,MAAM,EAAE,CAAA;IACxB,eAAe,EAAE,MAAM,EAAE,CAAA;IACzB,OAAO,EAAE,OAAO,CAAA;CACjB;AAID,MAAM,WAAW,oBAAoB;IACnC;;;;OAIG;IACH,wBAAwB,CAAC,EAAE,MAAM,EAAE,CAAA;IAEnC;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAA;CAChC;AAOD,qBAAa,cAAc;IAIb,OAAO,CAAC,KAAK;IAFzB,OAAO,CAAC,MAAM,CAAgC;gBAE1B,KAAK,EAAE,KAAK,EAAE,MAAM,GAAE,oBAAyB;IAOnE;;;OAGG;IACH,QAAQ,IAAI,uBAAuB;IA4DnC;;OAEG;IACH,OAAO,CAAC,YAAY;IA8DpB;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAmE9B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAoBrB;;;;OAIG;IACH,OAAO,CAAC,oBAAoB;IAsB5B;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IA6B5B,OAAO,CAAC,WAAW;CA+BpB"}