@grafloria/element 0.3.19 → 0.3.21

package/src/libs/engine/src/layout/algorithms/HybridLayoutAlgorithm.js

@@ -1,324 +0,0 @@
-"use strict";
-// HybridLayoutAlgorithm - Intelligent pattern detection and algorithm selection
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HybridLayoutAlgorithm = void 0;
-const ILayoutAlgorithm_1 = require("../ILayoutAlgorithm");
-const GridLayoutAlgorithm_1 = require("./GridLayoutAlgorithm");
-const HierarchicalLayoutAlgorithm_1 = require("./HierarchicalLayoutAlgorithm");
-const ForceDirectedLayoutAlgorithm_1 = require("./ForceDirectedLayoutAlgorithm");
-/**
- * HybridLayoutAlgorithm
- *
- * Intelligent layout algorithm that:
- * - Analyzes the diagram structure
- * - Detects patterns (grid, tree, network, sparse)
- * - Automatically selects the best algorithm
- * - Delegates to the chosen algorithm
- *
- * Pattern Detection:
- * - Grid: Few or no edges, uniform structure
- * - Tree/Hierarchy: Acyclic, directional flow
- * - Network: Dense connections, cycles
- * - Sparse: Few nodes, simple connections
- *
- * Best for:
- * - Dynamic diagrams where structure changes
- * - Mixed diagram types
- * - When user doesn't want to choose algorithm
- */
-class HybridLayoutAlgorithm extends ILayoutAlgorithm_1.BaseLayoutAlgorithm {
-    constructor(options) {
-        super();
-        this.hybridOptions = Object.assign({ fallbackAlgorithm: 'grid', enableAutoSwitch: true, analysisThreshold: 0.7 }, options);
-        // Initialize sub-algorithms
-        this.gridAlgorithm = new GridLayoutAlgorithm_1.GridLayoutAlgorithm();
-        this.hierarchicalAlgorithm = new HierarchicalLayoutAlgorithm_1.HierarchicalLayoutAlgorithm();
-        this.forceDirectedAlgorithm = new ForceDirectedLayoutAlgorithm_1.ForceDirectedLayoutAlgorithm();
-    }
-    getName() {
-        return 'Hybrid Layout (Auto)';
-    }
-    getType() {
-        return 'hybrid';
-    }
-    configure(config) {
-        if (config.options) {
-            this.hybridOptions = Object.assign(Object.assign({}, this.hybridOptions), config.options);
-        }
-        // Pass configuration to sub-algorithms
-        const hybridOpts = config.options;
-        if (hybridOpts === null || hybridOpts === void 0 ? void 0 : hybridOpts.gridOptions) {
-            this.gridAlgorithm.configure({ type: 'grid', options: hybridOpts.gridOptions });
-        }
-        if (hybridOpts === null || hybridOpts === void 0 ? void 0 : hybridOpts.hierarchicalOptions) {
-            this.hierarchicalAlgorithm.configure({
-                type: 'hierarchical',
-                options: hybridOpts.hierarchicalOptions,
-            });
-        }
-        if (hybridOpts === null || hybridOpts === void 0 ? void 0 : hybridOpts.forceDirectedOptions) {
-            this.forceDirectedAlgorithm.configure({
-                type: 'force-directed',
-                options: hybridOpts.forceDirectedOptions,
-            });
-        }
-    }
-    getConfiguration() {
-        return {
-            type: 'hybrid',
-            options: this.hybridOptions,
-        };
-    }
-    canApply(diagram) {
-        const nodes = diagram.getNodes();
-        if (nodes.length === 0) {
-            return { valid: false, reason: 'No nodes to layout' };
-        }
-        return { valid: true };
-    }
-    /**
-     * Analyze diagram structure and detect pattern
-     */
-    analyzePattern(diagram) {
-        const nodes = diagram.getNodes();
-        const links = diagram.getLinks();
-        const nodeCount = nodes.length;
-        const edgeCount = links.length;
-        // Calculate graph metrics
-        const density = nodeCount > 1 ? (2 * edgeCount) / (nodeCount * (nodeCount - 1)) : 0;
-        const avgDegree = nodeCount > 0 ? (2 * edgeCount) / nodeCount : 0;
-        // Build adjacency list
-        const adjacency = new Map();
-        const inDegree = new Map();
-        const outDegree = new Map();
-        nodes.forEach((node) => {
-            adjacency.set(node.id, new Set());
-            inDegree.set(node.id, 0);
-            outDegree.set(node.id, 0);
-        });
-        links.forEach((link) => {
-            var _a, _b;
-            if (link.sourceNodeId && link.targetNodeId) {
-                (_a = adjacency.get(link.sourceNodeId)) === null || _a === void 0 ? void 0 : _a.add(link.targetNodeId);
-                (_b = adjacency.get(link.targetNodeId)) === null || _b === void 0 ? void 0 : _b.add(link.sourceNodeId);
-                outDegree.set(link.sourceNodeId, (outDegree.get(link.sourceNodeId) || 0) + 1);
-                inDegree.set(link.targetNodeId, (inDegree.get(link.targetNodeId) || 0) + 1);
-            }
-        });
-        // Detect cycles using DFS
-        const hasCycles = this.detectCycles(adjacency, nodes.map((n) => n.id));
-        // Check if graph is directed (unequal in/out degrees)
-        let isDirected = false;
-        for (const nodeId of nodes.map((n) => n.id)) {
-            if (inDegree.get(nodeId) !== outDegree.get(nodeId)) {
-                isDirected = true;
-                break;
-            }
-        }
-        // Count connected components
-        const connectedComponents = this.countConnectedComponents(adjacency, nodes.map((n) => n.id));
-        // Pattern detection logic
-        let pattern;
-        let confidence;
-        let reason;
-        let recommendedAlgorithm;
-        // Rule 1: Very few or no edges -> Grid
-        if (edgeCount === 0 || density < 0.1) {
-            pattern = 'sparse';
-            confidence = 0.95;
-            reason = 'Few or no connections detected';
-            recommendedAlgorithm = 'grid';
-        }
-        // Rule 2: Acyclic + directed flow -> Tree/Hierarchy
-        else if (!hasCycles && isDirected && density < 0.4) {
-            pattern = 'tree';
-            confidence = 0.9;
-            reason = 'Acyclic directed graph detected (tree structure)';
-            recommendedAlgorithm = 'hierarchical';
-        }
-        // Rule 3: High connectivity or cycles -> Network
-        else if (hasCycles || density > 0.3 || avgDegree > 3) {
-            pattern = 'network';
-            confidence = 0.85;
-            reason = 'Dense network with cycles detected';
-            recommendedAlgorithm = 'force-directed';
-        }
-        // Rule 4: Medium connectivity, no clear pattern -> Network
-        else if (density >= 0.1 && density <= 0.3) {
-            pattern = 'network';
-            confidence = 0.7;
-            reason = 'Medium connectivity, using force-directed layout';
-            recommendedAlgorithm = 'force-directed';
-        }
-        // Fallback: Grid
-        else {
-            pattern = 'grid';
-            confidence = 0.6;
-            reason = 'No clear pattern detected, using grid layout';
-            recommendedAlgorithm = 'grid';
-        }
-        return {
-            pattern,
-            confidence,
-            reason,
-            recommendedAlgorithm,
-            metrics: {
-                nodeCount,
-                edgeCount,
-                density,
-                avgDegree,
-                hasCycles,
-                isDirected,
-                connectedComponents,
-            },
-        };
-    }
-    /**
-     * Detect cycles in graph using DFS
-     */
-    detectCycles(adjacency, nodeIds) {
-        const visited = new Set();
-        const recursionStack = new Set();
-        const dfs = (nodeId) => {
-            visited.add(nodeId);
-            recursionStack.add(nodeId);
-            const neighbors = adjacency.get(nodeId) || new Set();
-            for (const neighbor of neighbors) {
-                if (!visited.has(neighbor)) {
-                    if (dfs(neighbor))
-                        return true;
-                }
-                else if (recursionStack.has(neighbor)) {
-                    return true; // Back edge found (cycle)
-                }
-            }
-            recursionStack.delete(nodeId);
-            return false;
-        };
-        for (const nodeId of nodeIds) {
-            if (!visited.has(nodeId)) {
-                if (dfs(nodeId))
-                    return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Count connected components using BFS
-     */
-    countConnectedComponents(adjacency, nodeIds) {
-        const visited = new Set();
-        let components = 0;
-        const bfs = (startId) => {
-            const queue = [startId];
-            visited.add(startId);
-            while (queue.length > 0) {
-                const nodeId = queue.shift();
-                const neighbors = adjacency.get(nodeId) || new Set();
-                for (const neighbor of neighbors) {
-                    if (!visited.has(neighbor)) {
-                        visited.add(neighbor);
-                        queue.push(neighbor);
-                    }
-                }
-            }
-        };
-        for (const nodeId of nodeIds) {
-            if (!visited.has(nodeId)) {
-                bfs(nodeId);
-                components++;
-            }
-        }
-        return components;
-    }
-    calculatePlacement(options) {
-        // For single node placement, we need to consider existing structure
-        const { existingNodes } = options;
-        // If no existing nodes, just use grid
-        if (existingNodes.length === 0) {
-            return this.gridAlgorithm.calculatePlacement(options);
-        }
-        // Quick heuristic: if we have a last detected pattern, use that algorithm
-        if (this.lastDetectedPattern) {
-            switch (this.lastDetectedPattern) {
-                case 'grid':
-                case 'sparse':
-                    return this.gridAlgorithm.calculatePlacement(options);
-                case 'tree':
-                    return this.hierarchicalAlgorithm.calculatePlacement(options);
-                case 'network':
-                    return this.forceDirectedAlgorithm.calculatePlacement(options);
-            }
-        }
-        // Fallback to grid for single placement
-        return this.gridAlgorithm.calculatePlacement(options);
-    }
-    reLayout(diagram, config) {
-        if (config) {
-            this.configure(config);
-        }
-        // Analyze the diagram structure
-        const analysis = this.analyzePattern(diagram);
-        this.lastDetectedPattern = analysis.pattern;
-        console.log('🔍 Hybrid Layout Analysis:', {
-            pattern: analysis.pattern,
-            confidence: `${(analysis.confidence * 100).toFixed(0)}%`,
-            reason: analysis.reason,
-            algorithm: analysis.recommendedAlgorithm,
-            metrics: analysis.metrics,
-        });
-        // Select and apply algorithm based on analysis
-        let positions;
-        if (analysis.confidence >= (this.hybridOptions.analysisThreshold || 0.7)) {
-            switch (analysis.recommendedAlgorithm) {
-                case 'grid':
-                    console.log('📊 Applying Grid Layout');
-                    positions = this.gridAlgorithm.reLayout(diagram, config);
-                    break;
-                case 'hierarchical':
-                    console.log('🌳 Applying Hierarchical Layout');
-                    positions = this.hierarchicalAlgorithm.reLayout(diagram, config);
-                    break;
-                case 'force-directed':
-                    console.log('🧲 Applying Force-Directed Layout');
-                    positions = this.forceDirectedAlgorithm.reLayout(diagram, config);
-                    break;
-                default:
-                    positions = this.gridAlgorithm.reLayout(diagram, config);
-            }
-        }
-        else {
-            // Low confidence, use fallback
-            const fallback = this.hybridOptions.fallbackAlgorithm || 'grid';
-            console.log(`⚠️ Low confidence (${(analysis.confidence * 100).toFixed(0)}%), using fallback: ${fallback}`);
-            switch (fallback) {
-                case 'grid':
-                    positions = this.gridAlgorithm.reLayout(diagram, config);
-                    break;
-                case 'hierarchical':
-                    positions = this.hierarchicalAlgorithm.reLayout(diagram, config);
-                    break;
-                case 'force-directed':
-                    positions = this.forceDirectedAlgorithm.reLayout(diagram, config);
-                    break;
-                default:
-                    positions = this.gridAlgorithm.reLayout(diagram, config);
-            }
-        }
-        return positions;
-    }
-    onActivate() {
-        console.log('🎯 Hybrid layout activated (intelligent pattern detection)');
-    }
-    onDeactivate() {
-        console.log('🎯 Hybrid layout deactivated');
-    }
-    /**
-     * Get the last detected pattern (useful for debugging/UI)
-     */
-    getLastDetectedPattern() {
-        return this.lastDetectedPattern;
-    }
-}
-exports.HybridLayoutAlgorithm = HybridLayoutAlgorithm;
-//# sourceMappingURL=HybridLayoutAlgorithm.js.map

package/src/libs/engine/src/layout/algorithms/HybridLayoutAlgorithm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HybridLayoutAlgorithm.js","sourceRoot":"","sources":["../../../../../../../engine/src/layout/algorithms/HybridLayoutAlgorithm.ts"],"names":[],"mappings":";AAAA,gFAAgF;;;AAEhF,0DAAiF;AAKjF,+DAA4D;AAC5D,+EAA4E;AAC5E,iFAA8E;AAoB9E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,qBAAsB,SAAQ,sCAAmB;IAO5D,YAAY,OAAuB;QACjC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,aAAa,mBAChB,iBAAiB,EAAE,MAAM,EACzB,gBAAgB,EAAE,IAAI,EACtB,iBAAiB,EAAE,GAAG,IACnB,OAAO,CACX,CAAC;QAEF,4BAA4B;QAC5B,IAAI,CAAC,aAAa,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC/C,IAAI,CAAC,qBAAqB,GAAG,IAAI,yDAA2B,EAAE,CAAC;QAC/D,IAAI,CAAC,sBAAsB,GAAG,IAAI,2DAA4B,EAAE,CAAC;IACnE,CAAC;IAED,OAAO;QACL,OAAO,sBAAsB,CAAC;IAChC,CAAC;IAED,OAAO;QACL,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEQ,SAAS,CAAC,MAA2B;QAC5C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,mCACb,IAAI,CAAC,aAAa,GAClB,MAAM,CAAC,OAAO,CAClB,CAAC;QACJ,CAAC;QAED,uCAAuC;QACvC,MAAM,UAAU,GAAG,MAAM,CAAC,OAAoC,CAAC;QAC/D,IAAI,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,mBAAmB,EAAE,CAAC;YACpC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC;gBACnC,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,UAAU,CAAC,mBAAmB;aACxC,CAAC,CAAC;QACL,CAAC;QACD,IAAI,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,oBAAoB,EAAE,CAAC;YACrC,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC;gBACpC,IAAI,EAAE,gBAAgB;gBACtB,OAAO,EAAE,UAAU,CAAC,oBAAoB;aACzC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAEQ,gBAAgB;QACvB,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,IAAI,CAAC,aAAa;SAC5B,CAAC;IACJ,CAAC;IAEQ,QAAQ,CAAC,OAAqB;QACrC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC;QACxD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,OAAqB;QAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QAEjC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/B,0BAA0B;QAC1B,MAAM,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,MAAM,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,uBAAuB;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;YACrB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC3C,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACzD,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACzD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9E,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvE,sDAAsD;QACtD,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5C,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnD,UAAU,GAAG,IAAI,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,MAAM,mBAAmB,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE7F,0BAA0B;QAC1B,IAAI,OAAwB,CAAC;QAC7B,IAAI,UAAkB,CAAC;QACvB,IAAI,MAAc,CAAC;QACnB,IAAI,oBAAgE,CAAC;QAErE,uCAAuC;QACvC,IAAI,SAAS,KAAK,CAAC,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;YACrC,OAAO,GAAG,QAAQ,CAAC;YACnB,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,gCAAgC,CAAC;YAC1C,oBAAoB,GAAG,MAAM,CAAC;QAChC,CAAC;QACD,oDAAoD;aAC/C,IAAI,CAAC,SAAS,IAAI,UAAU,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;YACnD,OAAO,GAAG,MAAM,CAAC;YACjB,UAAU,GAAG,GAAG,CAAC;YACjB,MAAM,GAAG,kDAAkD,CAAC;YAC5D,oBAAoB,GAAG,cAAc,CAAC;QACxC,CAAC;QACD,iDAAiD;aAC5C,IAAI,SAAS,IAAI,OAAO,GAAG,GAAG,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,GAAG,SAAS,CAAC;YACpB,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,oCAAoC,CAAC;YAC9C,oBAAoB,GAAG,gBAAgB,CAAC;QAC1C,CAAC;QACD,2DAA2D;aACtD,IAAI,OAAO,IAAI,GAAG,IAAI,OAAO,IAAI,GAAG,EAAE,CAAC;YAC1C,OAAO,GAAG,SAAS,CAAC;YACpB,UAAU,GAAG,GAAG,CAAC;YACjB,MAAM,GAAG,kDAAkD,CAAC;YAC5D,oBAAoB,GAAG,gBAAgB,CAAC;QAC1C,CAAC;QACD,iBAAiB;aACZ,CAAC;YACJ,OAAO,GAAG,MAAM,CAAC;YACjB,UAAU,GAAG,GAAG,CAAC;YACjB,MAAM,GAAG,8CAA8C,CAAC;YACxD,oBAAoB,GAAG,MAAM,CAAC;QAChC,CAAC;QAED,OAAO;YACL,OAAO;YACP,UAAU;YACV,MAAM;YACN,oBAAoB;YACpB,OAAO,EAAE;gBACP,SAAS;gBACT,SAAS;gBACT,OAAO;gBACP,SAAS;gBACT,SAAS;gBACT,UAAU;gBACV,mBAAmB;aACpB;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,SAAmC,EAAE,OAAiB;QACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAW,EAAE;YACtC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE3B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YACrD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,IAAI,GAAG,CAAC,QAAQ,CAAC;wBAAE,OAAO,IAAI,CAAC;gBACjC,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,OAAO,IAAI,CAAC,CAAC,0BAA0B;gBACzC,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,IAAI,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,SAAmC,EACnC,OAAiB;QAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,EAAE;YAC9B,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAC9B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;gBAErD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC;gBACZ,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,kBAAkB,CAAC,OAAyB;QAC1C,oEAAoE;QACpE,MAAM,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;QAElC,sCAAsC;QACtC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACxD,CAAC;QAED,0EAA0E;QAC1E,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,QAAQ,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBACjC,KAAK,MAAM,CAAC;gBACZ,KAAK,QAAQ;oBACX,OAAO,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBACxD,KAAK,MAAM;oBACT,OAAO,IAAI,CAAC,qBAAqB,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBAChE,KAAK,SAAS;oBACZ,OAAO,IAAI,CAAC,sBAAsB,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;YACnE,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,OAAO,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACxD,CAAC;IAED,QAAQ,CAAC,OAAqB,EAAE,MAA4B;QAC1D,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,gCAAgC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,CAAC,mBAAmB,GAAG,QAAQ,CAAC,OAAO,CAAC;QAE5C,OAAO,CAAC,GAAG,CAAC,4BAA4B,EAAE;YACxC,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;YACxD,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,SAAS,EAAE,QAAQ,CAAC,oBAAoB;YACxC,OAAO,EAAE,QAAQ,CAAC,OAAO;SAC1B,CAAC,CAAC;QAEH,+CAA+C;QAC/C,IAAI,SAA6B,CAAC;QAElC,IAAI,QAAQ,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,IAAI,GAAG,CAAC,EAAE,CAAC;YACzE,QAAQ,QAAQ,CAAC,oBAAoB,EAAE,CAAC;gBACtC,KAAK,MAAM;oBACT,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;oBACvC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBACzD,MAAM;gBACR,KAAK,cAAc;oBACjB,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;oBAC/C,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,gBAAgB;oBACnB,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;oBACjD,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBAClE,MAAM;gBACR;oBACE,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,+BAA+B;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,iBAAiB,IAAI,MAAM,CAAC;YAChE,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uBAAuB,QAAQ,EAAE,CAAC,CAAC;YAE3G,QAAQ,QAAQ,EAAE,CAAC;gBACjB,KAAK,MAAM;oBACT,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBACzD,MAAM;gBACR,KAAK,cAAc;oBACjB,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,gBAAgB;oBACnB,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBAClE,MAAM;gBACR;oBACE,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,UAAU;QACR,OAAO,CAAC,GAAG,CAAC,4DAA4D,CAAC,CAAC;IAC5E,CAAC;IAED,YAAY;QACV,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,sBAAsB;QACpB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;CACF;AA9VD,sDA8VC"}

package/src/libs/engine/src/layout/community-layout-adapter.d.ts

@@ -1,107 +0,0 @@
-/**
- * Community Detection Layout Adapter
- *
- * Detects communities/clusters in graph and positions them separately.
- * Reveals modular structure and logical groupings in networks.
- *
- * Best for:
- * - Microservices architecture
- * - Organization charts
- * - Social network analysis
- * - Module detection
- *
- * Algorithm: Louvain community detection + force-directed sub-layouts
- *
- * @module layout/community-layout-adapter
- */
-import { NodeModel } from '../models/NodeModel';
-import { LinkModel } from '../models/LinkModel';
-import { LayoutAdapter, LayoutOptions, LayoutResult } from './layout-adapter.interface';
-/**
- * Community detection layout options
- */
-export interface CommunityLayoutOptions extends LayoutOptions {
-    /** Community detection algorithm (default: 'louvain') */
-    algorithm?: 'louvain' | 'label-propagation';
-    /** Resolution parameter for community detection (default: 1.0) */
-    resolution?: number;
-    /** Separate communities visually (default: true) */
-    separateCommunities?: boolean;
-    /** Spacing between communities (default: 200) */
-    communitySpacing?: number;
-    /** Layout algorithm for communities (default: 'circular') */
-    communityLayout?: 'circular' | 'grid' | 'force';
-    /** Layout algorithm within communities (default: 'force') */
-    innerLayout?: 'force' | 'circular';
-    /** Force layout options for inner layout */
-    forceOptions?: {
-        iterations?: number;
-        repulsion?: number;
-        attraction?: number;
-    };
-}
-/**
- * Community Detection Layout Adapter
- *
- * Uses Louvain algorithm to detect communities and arranges them.
- */
-export declare class CommunityLayoutAdapter implements LayoutAdapter {
-    readonly name = "community";
-    /**
-     * Card 0: the run's seeded generator. Established once per apply() so every
-     * helper below draws from the SAME reproducible stream — the seed alone is not
-     * enough if each helper mints its own generator.
-     */
-    private rng;
-    private forceAdapter;
-    /**
-     * Apply community detection layout
-     */
-    apply(nodes: NodeModel[], links: LinkModel[], options?: Partial<CommunityLayoutOptions>): Promise<LayoutResult>;
-    /**
-     * Louvain community detection algorithm
-     */
-    private louvainCommunityDetection;
-    /**
-     * Calculate modularity gain
-     */
-    private modularityGain;
-    /**
-     * Calculate total degree of nodes in community
-     */
-    private communityDegree;
-    /**
-     * Label propagation algorithm (simpler alternative)
-     */
-    private labelPropagation;
-    /**
-     * Build community objects
-     */
-    private buildCommunities;
-    /**
-     * Layout nodes within a community
-     */
-    private layoutCommunity;
-    /**
-     * Simple circular layout
-     */
-    private circularLayout;
-    /**
-     * Position communities relative to each other
-     */
-    private positionCommunities;
-    /**
-     * Calculate bounding box
-     */
-    private calculateBounds;
-    /**
-     * Apply incremental layout (Phase 1 compatibility)
-     */
-    applyIncremental(nodes: NodeModel[], links: LinkModel[], incrementalOptions: any, layoutOptions?: Partial<CommunityLayoutOptions>): Promise<LayoutResult & {
-        incremental: any;
-    }>;
-    /**
-     * Validate options
-     */
-    validateOptions(options: Partial<CommunityLayoutOptions>): boolean;
-}