noteconnection 0.9.0

package/dist/backend/algorithms/TopologicalSort.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TopologicalSort = void 0;
+/**
+ * Service to perform Topological Sort and Rank assignment.
+ * 执行拓扑排序和等级分配的服务。
+ */
+class TopologicalSort {
+    /**
+     * Assigns a topological rank (level) to each node.
+     * 为每个节点分配拓扑等级（层级）。
+     * Rank 0 = Roots (No dependencies).
+     * Rank N = Dependencies have max rank N-1.
+     *
+     * @param graph The graph to process.
+     * @returns Map of NodeId -> Rank.
+     */
+    static assignRanks(graph) {
+        const ranks = new Map();
+        const inDegrees = new Map();
+        const nodes = graph.getNodes();
+        // 1. Initialize In-Degrees
+        nodes.forEach(node => {
+            inDegrees.set(node.id, node.inDegree);
+            ranks.set(node.id, 0); // Default rank
+        });
+        // 2. Queue for nodes with in-degree 0
+        const queue = [];
+        nodes.forEach(node => {
+            if (node.inDegree === 0) {
+                queue.push(node.id);
+            }
+        });
+        // 3. Process Queue (Kahn's Algorithm variant for Longest Path)
+        // We want rank[v] = max(rank[v], rank[u] + 1)
+        // Standard Kahn's processes nodes when all dependencies are met.
+        // This implicitly ensures we processed all 'u' before 'v'.
+        let processedCount = 0;
+        while (queue.length > 0) {
+            const uId = queue.shift();
+            processedCount++;
+            const uRank = ranks.get(uId);
+            const neighbors = graph.getNeighbors(uId);
+            for (const vId of neighbors) {
+                // Update rank of v
+                const currentVRank = ranks.get(vId) || 0;
+                if (uRank + 1 > currentVRank) {
+                    ranks.set(vId, uRank + 1);
+                }
+                // Decrement in-degree
+                const d = inDegrees.get(vId) - 1;
+                inDegrees.set(vId, d);
+                if (d === 0) {
+                    queue.push(vId);
+                }
+            }
+        }
+        // 4. Handle Cycles
+        if (processedCount < nodes.length) {
+            console.warn(`Graph contains cycles! Processed ${processedCount}/${nodes.length} nodes.`);
+            // Nodes involved in cycles (or reachable from them) were not processed.
+            // Their ranks might be incorrect (default 0 or partial updates).
+            // We could identify them and push them to the bottom, or just leave as is.
+            // For now, we leave them. The CycleDetector should be used to resolve this separately.
+        }
+        return ranks;
+    }
+}
+exports.TopologicalSort = TopologicalSort;

package/dist/backend/algorithms/VectorSpace.js

@@ -0,0 +1,87 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VectorSpace = void 0;
+class VectorSpace {
+    constructor(files) {
+        this.vocab = new Map();
+        this.idf = new Map();
+        this.vectors = new Map();
+        this.build(files);
+    }
+    build(files) {
+        const docCount = files.length;
+        const docFreq = new Map();
+        const tokenizedDocs = new Map();
+        // 1. Tokenize & Build Vocabulary
+        files.forEach(file => {
+            const tokens = this.tokenize(file.content);
+            tokenizedDocs.set(file.filename, tokens);
+            const uniqueTokens = new Set(tokens);
+            uniqueTokens.forEach(token => {
+                docFreq.set(token, (docFreq.get(token) || 0) + 1);
+            });
+        });
+        // 2. Calculate IDF & Build Vocab Index
+        let index = 0;
+        docFreq.forEach((count, term) => {
+            if (count > 1) { // Ignore rare terms (min_doc_freq = 2)
+                this.vocab.set(term, index++);
+                this.idf.set(term, Math.log(docCount / (1 + count)));
+            }
+        });
+        // 3. Compute TF-IDF Vectors
+        tokenizedDocs.forEach((tokens, fileId) => {
+            const vector = new Array(this.vocab.size).fill(0);
+            const termCounts = new Map();
+            tokens.forEach(t => termCounts.set(t, (termCounts.get(t) || 0) + 1));
+            termCounts.forEach((count, term) => {
+                const idx = this.vocab.get(term);
+                if (idx !== undefined) {
+                    const tf = count / tokens.length;
+                    vector[idx] = tf * this.idf.get(term);
+                }
+            });
+            // L2 Normalize
+            const norm = Math.sqrt(vector.reduce((sum, val) => sum + val * val, 0));
+            if (norm > 0) {
+                for (let i = 0; i < vector.length; i++)
+                    vector[i] /= norm;
+            }
+            this.vectors.set(fileId, vector);
+        });
+    }
+    tokenize(text) {
+        // Bilingual tokenizer: English words or Chinese characters
+        // 双语分词器：匹配英文单词或单个中文字符
+        // Matches sequence of Alphanumeric OR Single CJK character
+        const regex = /[a-zA-Z0-9]+|[\u4e00-\u9fa5]/g;
+        return (text.match(regex) || []).map(t => t.toLowerCase());
+    }
+    getVector(fileId) {
+        return this.vectors.get(fileId);
+    }
+    getSimilar(fileId, topK = 5) {
+        const sourceVec = this.vectors.get(fileId);
+        if (!sourceVec)
+            return [];
+        const results = [];
+        this.vectors.forEach((targetVec, targetId) => {
+            if (fileId !== targetId) {
+                const score = this.cosineSimilarity(sourceVec, targetVec);
+                if (score > 0) {
+                    results.push({ id: targetId, score });
+                }
+            }
+        });
+        return results.sort((a, b) => b.score - a.score).slice(0, topK);
+    }
+    cosineSimilarity(vecA, vecB) {
+        let dot = 0;
+        // Since vectors are L2 normalized, cosine sim is just dot product
+        for (let i = 0; i < vecA.length; i++) {
+            dot += vecA[i] * vecB[i];
+        }
+        return dot;
+    }
+}
+exports.VectorSpace = VectorSpace;

package/dist/backend/build_dag.js

@@ -0,0 +1,164 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+// --- Implementations ---
+class LocalFileLoader {
+    /**
+     * Loads all .md files from a directory.
+     * 从目录加载所有 .md 文件。
+     */
+    static load(dirPath) {
+        if (!fs.existsSync(dirPath)) {
+            console.error(`Directory not found: ${dirPath}`);
+            return [];
+        }
+        const files = fs.readdirSync(dirPath);
+        const notes = [];
+        for (const file of files) {
+            if (path.extname(file).toLowerCase() === '.md') {
+                const fullPath = path.join(dirPath, file);
+                const content = fs.readFileSync(fullPath, 'utf-8');
+                const id = path.parse(file).name; // Filename as ID
+                notes.push({ id, content });
+            }
+        }
+        console.log(`Loaded ${notes.length} notes.`);
+        return notes;
+    }
+}
+class KeywordMatcher {
+    /**
+     * Escapes RegExp special characters.
+     * 转义正则特殊字符。
+     */
+    static escapeRegExp(string) {
+        return string.replace(/[.*+?^${}()|[\\]/g, '\\$&');
+    }
+    /**
+     * Finds edges where one note mentions another's title.
+     * 查找一个笔记提及另一个笔记标题的边。
+     */
+    static findMatches(notes) {
+        const edges = [];
+        const ids = notes.map(n => n.id);
+        // Pre-compile regex for each ID to improve performance
+        // 为每个 ID 预编译正则以提高性能
+        const idRegexes = ids.map(id => ({
+            id: id,
+            regex: new RegExp(`\\b${this.escapeRegExp(id)}\\b`, 'i') // Case insensitive, whole word
+        }));
+        for (const currentNote of notes) {
+            for (const other of idRegexes) {
+                if (currentNote.id === other.id)
+                    continue; // No self-loops
+                // If current note contains other note's ID
+                // 如果当前笔记包含其他笔记的 ID
+                if (other.regex.test(currentNote.content)) {
+                    // Logic: Mentioned (other) -> Mentioner (current)
+                    // Basic -> Advanced
+                    edges.push({
+                        source: other.id,
+                        target: currentNote.id,
+                        weight: 1 // Could count matches for higher weight
+                    });
+                }
+            }
+        }
+        console.log(`Discovered ${edges.length} edges.`);
+        return edges;
+    }
+}
+class StructureGenerator {
+    /**
+     * Converts to D3 JSON format with Degree calculation.
+     * 转换为 D3 JSON 格式并计算度数。
+     */
+    static generateJSON(notes, edges) {
+        // Calculate degrees
+        const inDegreeMap = new Map();
+        const outDegreeMap = new Map();
+        // Initialize maps
+        notes.forEach(n => {
+            inDegreeMap.set(n.id, 0);
+            outDegreeMap.set(n.id, 0);
+        });
+        // Sum degrees
+        edges.forEach(e => {
+            const currentIn = inDegreeMap.get(e.target) || 0;
+            inDegreeMap.set(e.target, currentIn + 1);
+            const currentOut = outDegreeMap.get(e.source) || 0;
+            outDegreeMap.set(e.source, currentOut + 1);
+        });
+        const d3Nodes = notes.map(n => ({
+            id: n.id,
+            group: 1,
+            inDegree: inDegreeMap.get(n.id) || 0,
+            outDegree: outDegreeMap.get(n.id) || 0
+        }));
+        const d3Links = edges.map(e => ({
+            source: e.source,
+            target: e.target,
+            value: e.weight
+        }));
+        return {
+            nodes: d3Nodes,
+            links: d3Links
+        };
+    }
+}
+// --- Main Execution ---
+const CONFIG = {
+    inputDir: path.join(__dirname, '../../testconcept'),
+    outputFile: path.join(__dirname, '../../src/frontend/graph_data.json')
+};
+function main() {
+    console.log("Starting DAG Build Process...");
+    // 1. Load Files
+    const notes = LocalFileLoader.load(CONFIG.inputDir);
+    // 2. Find Edges
+    const edges = KeywordMatcher.findMatches(notes);
+    // 3. Generate Graph Data
+    const graphData = StructureGenerator.generateJSON(notes, edges);
+    // 4. Write Output
+    const outputDir = path.dirname(CONFIG.outputFile);
+    if (!fs.existsSync(outputDir)) {
+        fs.mkdirSync(outputDir, { recursive: true });
+    }
+    fs.writeFileSync(CONFIG.outputFile, JSON.stringify(graphData, null, 2));
+    console.log(`Graph data written to: ${CONFIG.outputFile}`);
+}
+main();

package/dist/backend/config.js

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.config = void 0;
+exports.config = {
+    matchingStrategy: 'exact-phrase',
+    clusteringStrategy: 'label-propagation', // Default to current behavior
+    fuzzyThreshold: 2,
+    enableTags: true,
+    enableStatisticalInference: true, // Default on
+    enableVectorSimilarity: true, // Default on
+    enableHybridInference: true, // Default on
+    exclusionList: [
+    // Add common words or concepts here that cause too much noise
+    // e.g., "Introduction", "Summary", etc.
+    // For now, we leave it empty as a template
+    ]
+};

package/dist/backend/graph.js

@@ -0,0 +1,108 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Exporter = exports.GraphBuilder = void 0;
+const fs = __importStar(require("fs/promises"));
+class GraphBuilder {
+    static buildGraph(concepts) {
+        const nodes = concepts.map(c => ({
+            id: c.id,
+            label: c.title
+        }));
+        const edges = [];
+        const titleMap = new Map(); // lowercase title -> real id
+        // Pre-process titles for case-insensitive lookup
+        // 预处理标题以进行不区分大小写的查找
+        concepts.forEach(c => {
+            titleMap.set(c.title.toLowerCase(), c.id);
+        });
+        // 1. Explicit Dependencies (Placeholder for now)
+        // 1. 显式依赖 (目前占位)
+        // 2. Keyword Matching Strategy
+        // 2. 关键词匹配策略
+        concepts.forEach(sourceConcept => {
+            const contentLower = sourceConcept.content.toLowerCase();
+            concepts.forEach(targetConcept => {
+                if (sourceConcept.id === targetConcept.id)
+                    return; // Self-loop check
+                const targetTitle = targetConcept.title.toLowerCase();
+                // Filter out very short words to reduce noise (e.g. "Ice", "mW")
+                // 过滤掉非常短的单词以减少噪声 (例如 "Ice", "mW")
+                // Heuristic: Length >= 3 or specific whitelist
+                // 启发式：长度 >= 3 或特定白名单
+                if (targetTitle.length < 3)
+                    return;
+                // Check strict inclusion (maybe utilize regex boundary \b in future)
+                // 检查严格包含 (未来可能利用正则边界 \b)
+                if (contentLower.includes(targetTitle)) {
+                    // Heuristic: If A mentions B, B -> A (B is concept used in A)
+                    // 启发式：如果 A 提到 B，则 B -> A (B 是 A 中使用的概念)
+                    edges.push({
+                        source: targetConcept.id,
+                        target: sourceConcept.id,
+                        type: 'keyword',
+                        weight: 1.0
+                    });
+                }
+            });
+        });
+        // Deduplicate edges
+        // 去重边
+        const uniqueEdges = this.deduplicateEdges(edges);
+        return {
+            nodes,
+            edges: uniqueEdges
+        };
+    }
+    static deduplicateEdges(edges) {
+        const seen = new Set();
+        return edges.filter(e => {
+            const key = `${e.source}->${e.target}`;
+            if (seen.has(key))
+                return false;
+            seen.add(key);
+            return true;
+        });
+    }
+}
+exports.GraphBuilder = GraphBuilder;
+class Exporter {
+    static async exportToJSON(graph, outputPath) {
+        const json = JSON.stringify(graph, null, 2);
+        await fs.writeFile(outputPath, json, 'utf-8');
+        console.log(`Graph exported to ${outputPath}`);
+    }
+}
+exports.Exporter = Exporter;

package/dist/backend/main.js

@@ -0,0 +1,67 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+// src/backend/main.ts
+const path = __importStar(require("path"));
+const parser_1 = require("./parser");
+const graph_1 = require("./graph");
+async function main() {
+    const inputDir = path.resolve(__dirname, '../../testconcept');
+    const outputDir = path.resolve(__dirname, '../frontend');
+    const outputFile = path.join(outputDir, 'graph_data.json');
+    console.log(`Starting Build Process...`);
+    console.log(`Input Directory: ${inputDir}`);
+    // 1. Load Files
+    // 1. 加载文件
+    const rawFiles = await parser_1.FileLoader.loadFiles(inputDir);
+    console.log(`Loaded ${rawFiles.length} files.`);
+    if (rawFiles.length === 0) {
+        console.warn('No markdown files found. Exiting.');
+        return;
+    }
+    // 2. Parse Concepts
+    // 2. 解析概念
+    const concepts = parser_1.NoteParser.parse(rawFiles);
+    console.log(`Parsed ${concepts.length} concepts.`);
+    // 3. Build Graph
+    // 3. 构建图
+    const graph = graph_1.GraphBuilder.buildGraph(concepts);
+    console.log(`Graph Built: ${graph.nodes.length} Nodes, ${graph.edges.length} Edges.`);
+    // 4. Export
+    // 4. 导出
+    await graph_1.Exporter.exportToJSON(graph, outputFile);
+    console.log('Build Complete.');
+}
+main().catch(err => console.error(err));

package/dist/backend/parser.js

@@ -0,0 +1,94 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NoteParser = exports.FileLoader = void 0;
+// src/backend/parser.ts
+const fs_1 = require("fs");
+const path = __importStar(require("path"));
+// File Loader Implementation
+// 文件加载器实现
+class FileLoader {
+    static async loadFiles(directory) {
+        try {
+            const filenames = await fs_1.promises.readdir(directory);
+            const rawFiles = [];
+            for (const file of filenames) {
+                if (path.extname(file).toLowerCase() !== '.md')
+                    continue;
+                const fullPath = path.join(directory, file);
+                const stat = await fs_1.promises.stat(fullPath);
+                const content = await fs_1.promises.readFile(fullPath, 'utf-8');
+                rawFiles.push({
+                    filepath: fullPath,
+                    filename: file,
+                    content: content,
+                    modifiedTime: stat.mtime
+                });
+            }
+            return rawFiles;
+        }
+        catch (error) {
+            console.error(`Error loading files from ${directory}:`, error);
+            return [];
+        }
+    }
+}
+exports.FileLoader = FileLoader;
+// Note Parser Implementation
+// 笔记解析器实现
+class NoteParser {
+    static parse(files) {
+        return files.map(file => {
+            const id = path.parse(file.filename).name;
+            // Default title is ID, but can be extracted from first H1 if needed
+            // 默认标题为ID，但如果需要可以从第一个H1提取
+            const title = id;
+            // Simple parsing for now (Future: Extract YAML)
+            // 目前为简单解析（未来：提取 YAML）
+            // Removing special characters for cleaner keyword matching later
+            // 移除特殊字符以便后续更干净的关键词匹配
+            return {
+                id: id,
+                title: title,
+                content: file.content,
+                metadata: {
+                    tags: [],
+                    prerequisites: [] // Placeholder for v0.2.0 explicit parsing
+                }
+            };
+        });
+    }
+}
+exports.NoteParser = NoteParser;

package/dist/backend/test_robustness/test_hybrid.js

@@ -0,0 +1,60 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+const path = __importStar(require("path"));
+const FileLoader_1 = require("../FileLoader");
+const StatisticalAnalyzer_1 = require("../algorithms/StatisticalAnalyzer");
+const VectorSpace_1 = require("../algorithms/VectorSpace");
+const HybridEngine_1 = require("../algorithms/HybridEngine");
+async function run() {
+    const root = path.resolve(__dirname, '../../../testconcept');
+    console.log(`Loading files from: ${root}`);
+    const files = await FileLoader_1.FileLoader.loadFiles(root);
+    console.log(`Loaded ${files.length} files.`);
+    const terms = files.map(f => f.filename);
+    console.log('Building Statistical Matrix...');
+    const matrix = StatisticalAnalyzer_1.StatisticalAnalyzer.analyze(files, terms);
+    console.log('Building Vector Space...');
+    const vectorSpace = new VectorSpace_1.VectorSpace(files);
+    console.log('Running Hybrid Inference...');
+    const edges = HybridEngine_1.HybridEngine.infer(matrix, vectorSpace, 0.2, 0.1);
+    console.log(`Inferred ${edges.length} hybrid edges.`);
+    console.log('Top 20 Suggestions:');
+    edges.slice(0, 20).forEach(d => {
+        console.log(`[${d.source}] -> [${d.target}] (Conf: ${d.confidence.toFixed(2)}, Weight: ${d.weight.toFixed(2)})`);
+        console.log(`   Reason: ${d.reason}`);
+    });
+}
+run().catch(e => console.error(e));