spectra-cli 4.1.1

package/dist/panoramic/community/community-detector.js

@@ -0,0 +1,190 @@
+/**
+ * Louvain 社区检测 + oversized 社区分裂
+ * 参考 Graphify cluster.py 的分裂策略，简化为 graphology + louvain 纯 JS 实现
+ */
+import { UndirectedGraph } from 'graphology';
+import louvainImport from 'graphology-communities-louvain';
+// CJS 互操作
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+const louvain = (typeof louvainImport === 'function' ? louvainImport : louvainImport.default);
+// ============================================================
+// 常量
+// ============================================================
+/** oversized 社区阈值：占总节点的比例 */
+const MAX_COMMUNITY_FRACTION = 0.25;
+/** oversized 社区最小节点数 */
+const MIN_SPLIT_SIZE = 10;
+// ============================================================
+// 公共函数
+// ============================================================
+/**
+ * 从 GraphJSON（NetworkX node-link 格式）加载 graphology 无向图
+ */
+export function loadGraph(graphJson) {
+    const graph = new UndirectedGraph();
+    for (const node of graphJson.nodes) {
+        graph.addNode(node.id, {
+            label: node.label,
+            kind: node.kind,
+            ...node.metadata,
+        });
+    }
+    for (const edge of graphJson.links) {
+        // 跳过悬空边（source/target 不在节点集合中）
+        if (!graph.hasNode(edge.source) || !graph.hasNode(edge.target))
+            continue;
+        // 跳过已存在的边（无向图 a-b 与 b-a 等价）
+        if (graph.hasEdge(edge.source, edge.target))
+            continue;
+        graph.addEdge(edge.source, edge.target, {
+            relation: edge.relation,
+            confidence: edge.confidence,
+            confidenceScore: edge.confidenceScore,
+        });
+    }
+    return graph;
+}
+/**
+ * 执行 Louvain 社区检测
+ * 1. 运行 Louvain 算法分配 communityId
+ * 2. 对 oversized 社区执行二次分裂
+ * 3. 计算内聚度和核心节点
+ */
+export function detectCommunities(graph, options) {
+    const nodeCount = graph.order;
+    // 空图或单节点：直接返回
+    if (nodeCount <= 1) {
+        const nodes = graph.nodes();
+        const communities = nodes.length === 1
+            ? [{ id: 0, nodes, coreNodes: nodes, cohesion: 1 }]
+            : [];
+        const nodeCommunityMap = new Map();
+        for (const n of nodes)
+            nodeCommunityMap.set(n, 0);
+        return { communities, nodeCommunityMap };
+    }
+    // 运行 Louvain
+    const assignments = louvain(graph);
+    // 按社区 ID 分组节点
+    const communityGroups = new Map();
+    for (const [nodeId, commId] of Object.entries(assignments)) {
+        const id = typeof commId === 'number' ? commId : Number(commId);
+        let group = communityGroups.get(id);
+        if (!group) {
+            group = [];
+            communityGroups.set(id, group);
+        }
+        group.push(nodeId);
+    }
+    // 对 oversized 社区执行二次分裂
+    const splitThreshold = Math.max(MIN_SPLIT_SIZE, Math.floor(nodeCount * MAX_COMMUNITY_FRACTION));
+    const finalGroups = [];
+    for (const [, nodes] of communityGroups) {
+        if (nodes.length > splitThreshold && nodes.length >= MIN_SPLIT_SIZE) {
+            const subGroups = splitCommunity(graph, nodes);
+            finalGroups.push(...subGroups);
+        }
+        else {
+            finalGroups.push(nodes);
+        }
+    }
+    // 按节点数降序排序，生成最终社区 ID
+    finalGroups.sort((a, b) => b.length - a.length);
+    // 应用 minSize 过滤
+    const minSize = options?.minSize ?? 0;
+    const filteredGroups = finalGroups.filter(g => g.length >= minSize);
+    const nodeCommunityMap = new Map();
+    const communities = filteredGroups.map((nodes, idx) => {
+        for (const n of nodes)
+            nodeCommunityMap.set(n, idx);
+        return {
+            id: idx,
+            nodes: nodes.sort(),
+            coreNodes: getTopNodesByDegree(graph, nodes, 3),
+            cohesion: computeCohesion(graph, nodes),
+        };
+    });
+    return { communities, nodeCommunityMap };
+}
+// ============================================================
+// 内部函数
+// ============================================================
+/**
+ * 对 oversized 社区子图执行二次 Louvain 分裂
+ * 失败时返回原社区不分裂
+ */
+function splitCommunity(graph, nodes) {
+    try {
+        // 构建子图
+        const subGraph = new UndirectedGraph();
+        for (const n of nodes) {
+            subGraph.addNode(n, graph.getNodeAttributes(n));
+        }
+        const nodeSet = new Set(nodes);
+        for (const n of nodes) {
+            graph.forEachNeighbor(n, (neighbor) => {
+                if (nodeSet.has(neighbor) && !subGraph.hasEdge(n, neighbor)) {
+                    try {
+                        subGraph.addEdge(n, neighbor, graph.getEdgeAttributes(graph.edge(n, neighbor)));
+                    }
+                    catch {
+                        // 边已存在
+                    }
+                }
+            });
+        }
+        // 子图上运行 Louvain
+        const subAssignments = louvain(subGraph);
+        const subGroups = new Map();
+        for (const [nodeId, commId] of Object.entries(subAssignments)) {
+            const id = typeof commId === 'number' ? commId : Number(commId);
+            let group = subGroups.get(id);
+            if (!group) {
+                group = [];
+                subGroups.set(id, group);
+            }
+            group.push(nodeId);
+        }
+        // 仅在分裂产生 >= 2 个社区时接受结果
+        if (subGroups.size >= 2) {
+            return [...subGroups.values()];
+        }
+        return [nodes];
+    }
+    catch {
+        return [nodes];
+    }
+}
+/**
+ * 取社区内度数最高的 Top N 节点
+ */
+function getTopNodesByDegree(graph, nodes, topN) {
+    return nodes
+        .map(n => ({ id: n, degree: graph.degree(n) }))
+        .sort((a, b) => b.degree - a.degree)
+        .slice(0, topN)
+        .map(n => n.id);
+}
+/**
+ * 计算社区内聚度：社区内边数 / 最大可能边数
+ * 参考 Graphify cohesion_score
+ */
+function computeCohesion(graph, nodes) {
+    const n = nodes.length;
+    if (n <= 1)
+        return 1;
+    const maxPossible = (n * (n - 1)) / 2;
+    const nodeSet = new Set(nodes);
+    let internalEdges = 0;
+    for (const node of nodes) {
+        graph.forEachNeighbor(node, (neighbor) => {
+            if (nodeSet.has(neighbor)) {
+                internalEdges++;
+            }
+        });
+    }
+    // 无向图每条边被计数两次
+    internalEdges = internalEdges / 2;
+    return Math.round((internalEdges / maxPossible) * 1000) / 1000;
+}
+//# sourceMappingURL=community-detector.js.map

package/dist/panoramic/community/community-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-detector.js","sourceRoot":"","sources":["../../../src/panoramic/community/community-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,OAAO,aAAa,MAAM,gCAAgC,CAAC;AAG3D,UAAU;AACV,8DAA8D;AAC9D,MAAM,OAAO,GAAG,CAAC,OAAO,aAAa,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAE,aAAqB,CAAC,OAAO,CAEtE,CAAC;AAgChC,+DAA+D;AAC/D,KAAK;AACL,+DAA+D;AAE/D,6BAA6B;AAC7B,MAAM,sBAAsB,GAAG,IAAI,CAAC;AACpC,wBAAwB;AACxB,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,+DAA+D;AAC/D,OAAO;AACP,+DAA+D;AAE/D;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,SAAoB;IAC5C,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;YACrB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,IAAI,CAAC,QAAQ;SACjB,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,+BAA+B;QAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,SAAS;QACzE,4BAA4B;QAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAAE,SAAS;QACtD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;YACtC,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,eAAe,EAAE,IAAI,CAAC,eAAe;SACtC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAsB,EAAE,OAAuB;IAC/E,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;IAE9B,cAAc;IACd,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAoB,KAAK,CAAC,MAAM,KAAK,CAAC;YACrD,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;YACnD,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAC3C,CAAC;IAED,aAAa;IACb,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAEnC,cAAc;IACd,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC3D,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChE,IAAI,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED,uBAAuB;IACvB,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,sBAAsB,CAAC,CAAC,CAAC;IAChG,MAAM,WAAW,GAAe,EAAE,CAAC;IAEnC,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,GAAG,cAAc,IAAI,KAAK,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;YACpE,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAEhD,gBAAgB;IAChB,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC;IACtC,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC;IAEpE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,MAAM,WAAW,GAAoB,cAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACrE,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO;YACL,EAAE,EAAE,GAAG;YACP,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE;YACnB,SAAS,EAAE,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,QAAQ,EAAE,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;SACxC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,CAAC;AAC3C,CAAC;AAED,+DAA+D;AAC/D,OAAO;AACP,+DAA+D;AAE/D;;;GAGG;AACH,SAAS,cAAc,CAAC,KAAsB,EAAE,KAAe;IAC7D,IAAI,CAAC;QACH,OAAO;QACP,MAAM,QAAQ,GAAG,IAAI,eAAe,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,KAAK,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE;gBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5D,IAAI,CAAC;wBACH,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAE,CAAC,CAAC,CAAC;oBACnF,CAAC;oBAAC,MAAM,CAAC;wBACP,OAAO;oBACT,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QAED,gBAAgB;QAChB,MAAM,cAAc,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YAC9D,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAChE,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,KAAK,GAAG,EAAE,CAAC;gBACX,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3B,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,uBAAuB;QACvB,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,KAAsB,EAAE,KAAe,EAAE,IAAY;IAChF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;SACnC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;SACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,KAAsB,EAAE,KAAe;IAC9D,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAErB,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE;YACvC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,cAAc;IACd,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC;IAElC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACjE,CAAC"}

package/dist/panoramic/community/god-node-analyzer.d.ts

@@ -0,0 +1,28 @@
+/**
+ * God Node 识别 + 启发式过滤
+ * 参考 Graphify analyze.py 的 god_nodes 策略
+ * 排除文件级 hub（kind='package'）和纯容器节点（仅 contains 关系）
+ */
+import type { UndirectedGraph } from 'graphology';
+/** God Node 描述 */
+export interface GodNode {
+    /** 节点 ID */
+    id: string;
+    /** 显示标签 */
+    label: string;
+    /** 度数 */
+    degree: number;
+    /** 连接最多的关系类型 */
+    primaryRelation: string;
+    /** 所属社区 ID */
+    communityId: number;
+}
+/**
+ * 识别 God Node：度数 > 均值 + 2σ，排除 package 节点和纯 contains 节点
+ *
+ * @param graph - graphology 图实例
+ * @param nodeCommunityMap - 节点 → 社区 ID 映射
+ * @returns God Node 列表（按度数降序）
+ */
+export declare function findGodNodes(graph: UndirectedGraph, nodeCommunityMap: Map<string, number>): GodNode[];
+//# sourceMappingURL=god-node-analyzer.d.ts.map

package/dist/panoramic/community/god-node-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"god-node-analyzer.d.ts","sourceRoot":"","sources":["../../../src/panoramic/community/god-node-analyzer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAMlD,kBAAkB;AAClB,MAAM,WAAW,OAAO;IACtB,YAAY;IACZ,EAAE,EAAE,MAAM,CAAC;IACX,WAAW;IACX,KAAK,EAAE,MAAM,CAAC;IACd,SAAS;IACT,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB;IAChB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc;IACd,WAAW,EAAE,MAAM,CAAC;CACrB;AAMD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,eAAe,EACtB,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACpC,OAAO,EAAE,CA2CX"}

package/dist/panoramic/community/god-node-analyzer.js

@@ -0,0 +1,91 @@
+/**
+ * God Node 识别 + 启发式过滤
+ * 参考 Graphify analyze.py 的 god_nodes 策略
+ * 排除文件级 hub（kind='package'）和纯容器节点（仅 contains 关系）
+ */
+// ============================================================
+// 公共函数
+// ============================================================
+/**
+ * 识别 God Node：度数 > 均值 + 2σ，排除 package 节点和纯 contains 节点
+ *
+ * @param graph - graphology 图实例
+ * @param nodeCommunityMap - 节点 → 社区 ID 映射
+ * @returns God Node 列表（按度数降序）
+ */
+export function findGodNodes(graph, nodeCommunityMap) {
+    const nodes = graph.nodes();
+    if (nodes.length === 0)
+        return [];
+    // 计算所有节点度数
+    const degrees = nodes.map(n => graph.degree(n));
+    const mean = degrees.reduce((a, b) => a + b, 0) / degrees.length;
+    const variance = degrees.reduce((a, d) => a + (d - mean) ** 2, 0) / degrees.length;
+    const stdDev = Math.sqrt(variance);
+    const threshold = mean + 2 * stdDev;
+    // 阈值至少为 2，避免稀疏图中所有节点都被标记
+    const effectiveThreshold = Math.max(threshold, 2);
+    const godNodes = [];
+    for (const nodeId of nodes) {
+        const degree = graph.degree(nodeId);
+        if (degree <= effectiveThreshold)
+            continue;
+        // 过滤 1：排除 kind='package' 节点
+        const kind = graph.getNodeAttribute(nodeId, 'kind');
+        if (kind === 'package')
+            continue;
+        // 过滤 2：排除仅有 contains 关系的节点
+        if (isContainsOnly(graph, nodeId))
+            continue;
+        // 统计主要关系类型
+        const primaryRelation = getPrimaryRelation(graph, nodeId);
+        godNodes.push({
+            id: nodeId,
+            label: graph.getNodeAttribute(nodeId, 'label') ?? nodeId,
+            degree,
+            primaryRelation,
+            communityId: nodeCommunityMap.get(nodeId) ?? -1,
+        });
+    }
+    // 按度数降序排序
+    godNodes.sort((a, b) => b.degree - a.degree);
+    return godNodes;
+}
+// ============================================================
+// 内部函数
+// ============================================================
+/**
+ * 检查节点是否仅有 contains 关系
+ */
+function isContainsOnly(graph, nodeId) {
+    let hasNonContains = false;
+    graph.forEachEdge(nodeId, (_edge, attrs) => {
+        if (hasNonContains)
+            return;
+        const relation = attrs['relation'];
+        if (relation !== 'contains') {
+            hasNonContains = true;
+        }
+    });
+    return !hasNonContains;
+}
+/**
+ * 获取节点连接最多��关系类型
+ */
+function getPrimaryRelation(graph, nodeId) {
+    const counts = new Map();
+    graph.forEachEdge(nodeId, (_edge, attrs) => {
+        const relation = attrs['relation'] ?? 'unknown';
+        counts.set(relation, (counts.get(relation) ?? 0) + 1);
+    });
+    let maxRelation = 'unknown';
+    let maxCount = 0;
+    for (const [relation, count] of counts) {
+        if (count > maxCount) {
+            maxCount = count;
+            maxRelation = relation;
+        }
+    }
+    return maxRelation;
+}
+//# sourceMappingURL=god-node-analyzer.js.map

package/dist/panoramic/community/god-node-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"god-node-analyzer.js","sourceRoot":"","sources":["../../../src/panoramic/community/god-node-analyzer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAsBH,+DAA+D;AAC/D,OAAO;AACP,+DAA+D;AAE/D;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAsB,EACtB,gBAAqC;IAErC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,WAAW;IACX,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACjE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACnF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC;IAEpC,yBAAyB;IACzB,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAElD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,MAAM,IAAI,kBAAkB;YAAE,SAAS;QAE3C,4BAA4B;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAuB,CAAC;QAC1E,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QAEjC,2BAA2B;QAC3B,IAAI,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC;YAAE,SAAS;QAE5C,WAAW;QACX,MAAM,eAAe,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE1D,QAAQ,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,MAAM;YACV,KAAK,EAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAY,IAAI,MAAM;YACpE,MAAM;YACN,eAAe;YACf,WAAW,EAAE,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SAChD,CAAC,CAAC;IACL,CAAC;IAED,UAAU;IACV,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE7C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+DAA+D;AAC/D,OAAO;AACP,+DAA+D;AAE/D;;GAEG;AACH,SAAS,cAAc,CAAC,KAAsB,EAAE,MAAc;IAC5D,IAAI,cAAc,GAAG,KAAK,CAAC;IAC3B,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACzC,IAAI,cAAc;YAAE,OAAO;QAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAuB,CAAC;QACzD,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;YAC5B,cAAc,GAAG,IAAI,CAAC;QACxB,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,cAAc,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAsB,EAAE,MAAc;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACzC,MAAM,QAAQ,GAAI,KAAK,CAAC,UAAU,CAAY,IAAI,SAAS,CAAC;QAC5D,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,WAAW,GAAG,SAAS,CAAC;IAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACvC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,QAAQ,GAAG,KAAK,CAAC;YACjB,WAAW,GAAG,QAAQ,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/dist/panoramic/community/graph-report-generator.d.ts

@@ -0,0 +1,31 @@
+/**
+ * GRAPH_REPORT.md 渲染器
+ * 将社区分析结果渲染为人类可读的 Markdown 架构洞察报告
+ * 内容使用中文，节点名/路径保持英文
+ */
+import type { CommunityInfo } from './community-detector.js';
+import type { GodNode } from './god-node-analyzer.js';
+import type { SurprisingEdge } from './surprising-edges.js';
+/** 图统计信息 */
+export interface GraphStats {
+    /** 节点总数 */
+    nodeCount: number;
+    /** 边总数 */
+    edgeCount: number;
+    /** 社区数 */
+    communityCount: number;
+    /** 孤立节点列表（度数 0-1） */
+    isolatedNodes: string[];
+}
+/** 报告生成输入 */
+export interface ReportInput {
+    stats: GraphStats;
+    communities: CommunityInfo[];
+    godNodes: GodNode[];
+    surprisingEdges: SurprisingEdge[];
+}
+/**
+ * 生成 GRAPH_REPORT.md 内容
+ */
+export declare function generateReport(input: ReportInput): string;
+//# sourceMappingURL=graph-report-generator.d.ts.map

package/dist/panoramic/community/graph-report-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-report-generator.d.ts","sourceRoot":"","sources":["../../../src/panoramic/community/graph-report-generator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAM5D,YAAY;AACZ,MAAM,WAAW,UAAU;IACzB,WAAW;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU;IACV,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU;IACV,cAAc,EAAE,MAAM,CAAC;IACvB,qBAAqB;IACrB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,aAAa;AACb,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,aAAa,EAAE,CAAC;IAC7B,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,eAAe,EAAE,cAAc,EAAE,CAAC;CACnC;AAMD;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAwFzD"}

package/dist/panoramic/community/graph-report-generator.js

@@ -0,0 +1,98 @@
+/**
+ * GRAPH_REPORT.md 渲染器
+ * 将社区分析结果渲染为人类可读的 Markdown 架构洞察报告
+ * 内容使用中文，节点名/路径保持英文
+ */
+// ============================================================
+// 公共函数
+// ============================================================
+/**
+ * 生成 GRAPH_REPORT.md 内容
+ */
+export function generateReport(input) {
+    const { stats, communities, godNodes, surprisingEdges } = input;
+    const sections = [];
+    // 标题
+    sections.push(`# 架构图谱分析报告`);
+    sections.push('');
+    sections.push(`> 自动生成于 ${new Date().toISOString().split('T')[0]}`);
+    sections.push('');
+    // 概述
+    sections.push('## 概述');
+    sections.push('');
+    sections.push(`| 指标 | 数值 |`);
+    sections.push(`|------|------|`);
+    sections.push(`| 节点 | ${stats.nodeCount} |`);
+    sections.push(`| 边 | ${stats.edgeCount} |`);
+    sections.push(`| 社区 | ${stats.communityCount} |`);
+    sections.push(`| 孤立节点 | ${stats.isolatedNodes.length} |`);
+    sections.push('');
+    // God Nodes
+    sections.push('## God Nodes');
+    sections.push('');
+    if (godNodes.length === 0) {
+        sections.push('未检测到度数异常高的节点。');
+    }
+    else {
+        sections.push('度数显著高于平均值（> 均值 + 2σ）的核心枢纽节点：');
+        sections.push('');
+        sections.push('| 节点 | 度数 | 主要关系类型 | 社区 |');
+        sections.push('|------|------|-------------|------|');
+        for (const node of godNodes) {
+            sections.push(`| \`${node.label}\` | ${node.degree} | ${node.primaryRelation} | ${node.communityId} |`);
+        }
+    }
+    sections.push('');
+    // 社区列表
+    sections.push('## 社区列表');
+    sections.push('');
+    if (communities.length === 0) {
+        sections.push('未检测到有效社区。');
+    }
+    else {
+        sections.push('| 社区 ID | 节点数 | 内聚度 | 核心节点 Top 3 |');
+        sections.push('|---------|--------|--------|---------------|');
+        for (const comm of communities) {
+            const coreStr = comm.coreNodes.map(n => `\`${n}\``).join(', ');
+            sections.push(`| ${comm.id} | ${comm.nodes.length} | ${comm.cohesion.toFixed(3)} | ${coreStr} |`);
+        }
+    }
+    sections.push('');
+    // Surprising Connections
+    sections.push('## Surprising Connections');
+    sections.push('');
+    if (surprisingEdges.length === 0) {
+        sections.push('未检测到跨社区异常连接。');
+    }
+    else {
+        sections.push('跨社区或低置信度的意外关系：');
+        sections.push('');
+        sections.push('| Source | Target | 关系类型 | 跨社区 | 置信度 | 评分 |');
+        sections.push('|--------|--------|---------|--------|--------|------|');
+        for (const edge of surprisingEdges) {
+            const cross = edge.crossCommunity ? '是' : '否';
+            sections.push(`| \`${edge.source}\` | \`${edge.target}\` | ${edge.relation} | ${cross} | ${edge.confidence} | ${edge.score} |`);
+        }
+    }
+    sections.push('');
+    // Knowledge Gaps
+    sections.push('## Knowledge Gaps');
+    sections.push('');
+    if (stats.isolatedNodes.length === 0) {
+        sections.push('无孤立节点，知识图谱覆盖良好。');
+    }
+    else {
+        sections.push(`检测到 ${stats.isolatedNodes.length} 个孤立节点（度数 0-1），可能存在文档覆盖不足：`);
+        sections.push('');
+        const displayed = stats.isolatedNodes.slice(0, 20);
+        for (const node of displayed) {
+            sections.push(`- \`${node}\``);
+        }
+        if (stats.isolatedNodes.length > 20) {
+            sections.push(`- ...及其他 ${stats.isolatedNodes.length - 20} 个节点`);
+        }
+    }
+    sections.push('');
+    return sections.join('\n');
+}
+//# sourceMappingURL=graph-report-generator.js.map

package/dist/panoramic/community/graph-report-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-report-generator.js","sourceRoot":"","sources":["../../../src/panoramic/community/graph-report-generator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA8BH,+DAA+D;AAC/D,OAAO;AACP,+DAA+D;AAE/D;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB;IAC/C,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,GAAG,KAAK,CAAC;IAChE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK;IACL,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,QAAQ,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,KAAK;IACL,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC7B,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACjC,QAAQ,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC7C,QAAQ,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC5C,QAAQ,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC;IAClD,QAAQ,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1D,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,YAAY;IACZ,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC9B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACjC,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC3C,QAAQ,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,MAAM,IAAI,CAAC,eAAe,MAAM,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QAC1G,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,OAAO;IACP,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;QACpD,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QAC/D,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/D,QAAQ,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC;QACpG,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,yBAAyB;IACzB,QAAQ,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC3C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAChC,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;QAC7D,QAAQ,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;QACxE,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC9C,QAAQ,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,QAAQ,MAAM,KAAK,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAClI,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,iBAAiB;IACjB,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,aAAa,CAAC,MAAM,4BAA4B,CAAC,CAAC;QAC7E,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,EAAE,MAAM,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAElB,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC"}

package/dist/panoramic/community/index.d.ts

@@ -0,0 +1,31 @@
+/**
+ * 社区分析模块统一导出入口
+ * 提供社区检测、God Node 识别、异常边发现和报告生成能力
+ */
+import type { GraphJSON } from '../graph/graph-types.js';
+export type { CommunityInfo, CommunityResult, DetectOptions } from './community-detector.js';
+export type { GodNode } from './god-node-analyzer.js';
+export type { SurprisingEdge, SurprisingEdgesOptions } from './surprising-edges.js';
+export type { GraphStats, ReportInput } from './graph-report-generator.js';
+export { loadGraph, detectCommunities } from './community-detector.js';
+export { findGodNodes } from './god-node-analyzer.js';
+export { findSurprisingEdges } from './surprising-edges.js';
+export { generateReport } from './graph-report-generator.js';
+/** 分析管道选项 */
+export interface CommunityAnalysisOptions {
+    /** 最小社区节点数过滤 */
+    minSize?: number;
+    /** betweenness 采样的源节点数（默认 1000） */
+    sampleSize?: number;
+}
+/**
+ * 执行完整社区分析管道并写入报告
+ * 供 batch-orchestrator 和 CLI 命令调用
+ *
+ * @param graphJson - GraphJSON 数据
+ * @param outputDir - 输出目录（报告写入 {outputDir}/_meta/GRAPH_REPORT.md）
+ * @param options - 分析选项
+ * @returns 报告文件路径
+ */
+export declare function runCommunityAnalysis(graphJson: GraphJSON, outputDir: string, options?: CommunityAnalysisOptions): string;
+//# sourceMappingURL=index.d.ts.map

package/dist/panoramic/community/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/panoramic/community/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AASzD,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAC7F,YAAY,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACtD,YAAY,EAAE,cAAc,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpF,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAG3E,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAM7D,aAAa;AACb,MAAM,WAAW,wBAAwB;IACvC,gBAAgB;IAChB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,SAAS,EACpB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE,wBAAwB,GACjC,MAAM,CA6CR"}

package/dist/panoramic/community/index.js

@@ -0,0 +1,63 @@
+/**
+ * 社区分析模块统一导出入口
+ * 提供社区检测、God Node 识别、异常边发现和报告生成能力
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+import { enrichNodeDegrees } from '../graph/graph-builder.js';
+import { loadGraph, detectCommunities } from './community-detector.js';
+import { findGodNodes } from './god-node-analyzer.js';
+import { findSurprisingEdges } from './surprising-edges.js';
+import { generateReport } from './graph-report-generator.js';
+// 函数导出
+export { loadGraph, detectCommunities } from './community-detector.js';
+export { findGodNodes } from './god-node-analyzer.js';
+export { findSurprisingEdges } from './surprising-edges.js';
+export { generateReport } from './graph-report-generator.js';
+/**
+ * 执行完整社区分析管道并写入报告
+ * 供 batch-orchestrator 和 CLI 命令调用
+ *
+ * @param graphJson - GraphJSON 数据
+ * @param outputDir - 输出目录（报告写入 {outputDir}/_meta/GRAPH_REPORT.md）
+ * @param options - 分析选项
+ * @returns 报告文件路径
+ */
+export function runCommunityAnalysis(graphJson, outputDir, options) {
+    // 加载图
+    const graph = loadGraph(graphJson);
+    // 社区检测
+    const { communities, nodeCommunityMap } = detectCommunities(graph, {
+        minSize: options?.minSize,
+    });
+    // God Node 识别
+    const godNodes = findGodNodes(graph, nodeCommunityMap);
+    // 将 degree 写入 graphJson 节点 metadata（供 hook 脚本读取）
+    enrichNodeDegrees(graphJson, godNodes);
+    // 异常边发现
+    const surprisingEdges = findSurprisingEdges(graph, nodeCommunityMap, {
+        sampleSize: options?.sampleSize,
+    });
+    // 统计孤立节点
+    const isolatedNodes = [];
+    graph.forEachNode((node) => {
+        if (graph.degree(node) <= 1) {
+            isolatedNodes.push(node);
+        }
+    });
+    // 生成报告
+    const stats = {
+        nodeCount: graph.order,
+        edgeCount: graph.size,
+        communityCount: communities.length,
+        isolatedNodes,
+    };
+    const report = generateReport({ stats, communities, godNodes, surprisingEdges });
+    // 写入文件
+    const metaDir = path.join(outputDir, '_meta');
+    fs.mkdirSync(metaDir, { recursive: true });
+    const reportPath = path.join(metaDir, 'GRAPH_REPORT.md');
+    fs.writeFileSync(reportPath, report, 'utf-8');
+    return reportPath;
+}
+//# sourceMappingURL=index.js.map

package/dist/panoramic/community/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/panoramic/community/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAS7D,OAAO;AACP,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAc7D;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,SAAoB,EACpB,SAAiB,EACjB,OAAkC;IAElC,MAAM;IACN,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IAEnC,OAAO;IACP,MAAM,EAAE,WAAW,EAAE,gBAAgB,EAAE,GAAG,iBAAiB,CAAC,KAAK,EAAE;QACjE,OAAO,EAAE,OAAO,EAAE,OAAO;KAC1B,CAAC,CAAC;IAEH,cAAc;IACd,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAEvD,iDAAiD;IACjD,iBAAiB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEvC,QAAQ;IACR,MAAM,eAAe,GAAG,mBAAmB,CAAC,KAAK,EAAE,gBAAgB,EAAE;QACnE,UAAU,EAAE,OAAO,EAAE,UAAU;KAChC,CAAC,CAAC;IAEH,SAAS;IACT,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO;IACP,MAAM,KAAK,GAAe;QACxB,SAAS,EAAE,KAAK,CAAC,KAAK;QACtB,SAAS,EAAE,KAAK,CAAC,IAAI;QACrB,cAAc,EAAE,WAAW,CAAC,MAAM;QAClC,aAAa;KACd,CAAC;IAEF,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC,CAAC;IAEjF,OAAO;IACP,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC9C,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IACzD,EAAE,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAE9C,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/panoramic/community/surprising-edges.d.ts

@@ -0,0 +1,42 @@
+/**
+ * 跨社区异常边发现 + betweenness 近似采样
+ * 参考 Graphify analyze.py 的 surprising_connections 策略
+ * 复合评分：跨社区加成 + 置信度权重 + betweenness centrality
+ */
+import type { UndirectedGraph } from 'graphology';
+/** 异常边描述 */
+export interface SurprisingEdge {
+    /** 来源节点 ID */
+    source: string;
+    /** 目标节点 ID */
+    target: string;
+    /** 关系类型 */
+    relation: string;
+    /** 置信度标签 */
+    confidence: string;
+    /** 是否跨社区 */
+    crossCommunity: boolean;
+    /** 复合惊奇度评分（越高越"意外"） */
+    score: number;
+}
+/** 发现选项 */
+export interface SurprisingEdgesOptions {
+    /** betweenness 采样的源节点数（默认 1000） */
+    sampleSize?: number;
+    /** 返回 Top N 条异常边（默认 10） */
+    topN?: number;
+}
+/**
+ * 发现跨社区异常边
+ * 评分策略：
+ * 1. 跨社区加成（+3）
+ * 2. 置信度权重（AMBIGUOUS=3, INFERRED=2, EXTRACTED=1）
+ * 3. betweenness centrality 采样归一化加成
+ *
+ * @param graph - graphology 图实例
+ * @param nodeCommunityMap - 节点 → 社区 ID 映射
+ * @param options - 采样和返回数量配置
+ * @returns 异常边列表（按评分降序）
+ */
+export declare function findSurprisingEdges(graph: UndirectedGraph, nodeCommunityMap: Map<string, number>, options?: SurprisingEdgesOptions): SurprisingEdge[];
+//# sourceMappingURL=surprising-edges.d.ts.map

package/dist/panoramic/community/surprising-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"surprising-edges.d.ts","sourceRoot":"","sources":["../../../src/panoramic/community/surprising-edges.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAOlD,YAAY;AACZ,MAAM,WAAW,cAAc;IAC7B,cAAc;IACd,MAAM,EAAE,MAAM,CAAC;IACf,cAAc;IACd,MAAM,EAAE,MAAM,CAAC;IACf,WAAW;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY;IACZ,cAAc,EAAE,OAAO,CAAC;IACxB,uBAAuB;IACvB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,WAAW;AACX,MAAM,WAAW,sBAAsB;IACrC,mCAAmC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2BAA2B;IAC3B,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAiBD;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,eAAe,EACtB,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EACrC,OAAO,CAAC,EAAE,sBAAsB,GAC/B,cAAc,EAAE,CAuDlB"}