@grafloria/element 0.3.19 → 0.3.21

package/src/libs/engine/src/layout/algorithms/HierarchicalLayoutAlgorithm.d.ts

@@ -1,60 +0,0 @@
-/**
- * Hierarchical Layout Algorithm
- *
- * Uses Dagre library to create hierarchical/layered layouts for directed graphs.
- * Perfect for:
- * - Flowcharts
- * - Process diagrams
- * - Decision trees
- * - Organizational charts
- * - Any directed acyclic graph (DAG)
- *
- * Features:
- * - Respects edge direction (parent → child flow)
- * - Minimizes edge crossings
- * - Clear visual hierarchy
- * - Configurable direction (TB, BT, LR, RL)
- * - Professional appearance
- */
-import { DiagramModel } from '../../models/DiagramModel';
-import { Point } from '../../types';
-import { BaseLayoutAlgorithm } from '../ILayoutAlgorithm';
-import { PlacementOptions, PlacementResult, LayoutConfiguration } from '../types';
-export declare class HierarchicalLayoutAlgorithm extends BaseLayoutAlgorithm {
-    private hierarchicalOptions;
-    constructor(config?: LayoutConfiguration);
-    getName(): string;
-    getType(): 'hierarchical';
-    /**
-     * Calculate placement for a single new node
-     * For hierarchical layout, we'll place it near connected nodes
-     */
-    calculatePlacement(options: PlacementOptions): PlacementResult;
-    /**
-     * Re-layout all nodes using Dagre
-     */
-    reLayout(diagram: DiagramModel, config?: LayoutConfiguration): Map<string, Point>;
-    /**
-     * Configure hierarchical-specific options
-     */
-    configure(config: LayoutConfiguration): void;
-    /**
-     * Hierarchical layout works best on DAGs but can handle any graph
-     */
-    canApply(diagram: DiagramModel): {
-        valid: boolean;
-        reason?: string;
-    };
-    /**
-     * Find nodes that are connected to the given node
-     */
-    private findConnectedNodes;
-    /**
-     * Calculate average position of nodes
-     */
-    private calculateAveragePosition;
-    /**
-     * Detect cycles in the graph (simplified DFS approach)
-     */
-    private detectCycles;
-}

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

@@ -1,307 +0,0 @@
-"use strict";
-/**
- * Hierarchical Layout Algorithm
- *
- * Uses Dagre library to create hierarchical/layered layouts for directed graphs.
- * Perfect for:
- * - Flowcharts
- * - Process diagrams
- * - Decision trees
- * - Organizational charts
- * - Any directed acyclic graph (DAG)
- *
- * Features:
- * - Respects edge direction (parent → child flow)
- * - Minimizes edge crossings
- * - Clear visual hierarchy
- * - Configurable direction (TB, BT, LR, RL)
- * - Professional appearance
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HierarchicalLayoutAlgorithm = void 0;
-const dagre = require("@dagrejs/dagre");
-const ILayoutAlgorithm_1 = require("../ILayoutAlgorithm");
-const ViewportTransform_1 = require("../ViewportTransform");
-const SmartSpacingCalculator_1 = require("../SmartSpacingCalculator");
-class HierarchicalLayoutAlgorithm extends ILayoutAlgorithm_1.BaseLayoutAlgorithm {
-    constructor(config) {
-        super(config);
-        this.hierarchicalOptions = (config === null || config === void 0 ? void 0 : config.options) || {};
-    }
-    getName() {
-        return 'Hierarchical Layout';
-    }
-    getType() {
-        return 'hierarchical';
-    }
-    /**
-     * Calculate placement for a single new node
-     * For hierarchical layout, we'll place it near connected nodes
-     */
-    calculatePlacement(options) {
-        var _a, _b;
-        const { node, viewport, existingNodes, spacing = this.hierarchicalOptions.nodeSpacing || 50, padding = 100, } = options;
-        // Get node dimensions
-        const nodeWidth = ((_a = node.size) === null || _a === void 0 ? void 0 : _a.width) || 200;
-        const nodeHeight = ((_b = node.size) === null || _b === void 0 ? void 0 : _b.height) || 100;
-        // If no existing nodes, place at start position
-        if (existingNodes.length === 0) {
-            return {
-                position: { x: padding, y: padding },
-                success: true,
-                metadata: {
-                    reason: 'First node in diagram',
-                },
-            };
-        }
-        // Find connected nodes (nodes this node links to or from)
-        const connectedNodes = this.findConnectedNodes(node, existingNodes);
-        if (connectedNodes.length > 0) {
-            // Place near connected nodes
-            const avgPosition = this.calculateAveragePosition(connectedNodes);
-            // Offset below the average position (assuming top-to-bottom flow)
-            const direction = this.hierarchicalOptions.direction || 'TB';
-            let candidate;
-            switch (direction) {
-                case 'TB': // Top to bottom
-                    candidate = {
-                        x: avgPosition.x,
-                        y: avgPosition.y + nodeHeight + spacing,
-                    };
-                    break;
-                case 'BT': // Bottom to top
-                    candidate = {
-                        x: avgPosition.x,
-                        y: avgPosition.y - nodeHeight - spacing,
-                    };
-                    break;
-                case 'LR': // Left to right
-                    candidate = {
-                        x: avgPosition.x + nodeWidth + spacing,
-                        y: avgPosition.y,
-                    };
-                    break;
-                case 'RL': // Right to left
-                    candidate = {
-                        x: avgPosition.x - nodeWidth - spacing,
-                        y: avgPosition.y,
-                    };
-                    break;
-                default:
-                    candidate = avgPosition;
-            }
-            // Check for collisions and adjust if needed
-            if (!this.hasCollision(candidate, { width: nodeWidth, height: nodeHeight }, existingNodes, spacing)) {
-                return {
-                    position: candidate,
-                    success: true,
-                    metadata: {
-                        reason: `Placed near ${connectedNodes.length} connected node(s)`,
-                    },
-                };
-            }
-        }
-        // Fallback: Place at next available position
-        const bounds = this.calculateBounds(existingNodes);
-        if (bounds) {
-            const direction = this.hierarchicalOptions.direction || 'TB';
-            let fallbackPosition;
-            switch (direction) {
-                case 'TB':
-                    fallbackPosition = {
-                        x: bounds.minX,
-                        y: bounds.maxY + spacing,
-                    };
-                    break;
-                case 'BT':
-                    fallbackPosition = {
-                        x: bounds.minX,
-                        y: bounds.minY - nodeHeight - spacing,
-                    };
-                    break;
-                case 'LR':
-                    fallbackPosition = {
-                        x: bounds.maxX + spacing,
-                        y: bounds.minY,
-                    };
-                    break;
-                case 'RL':
-                    fallbackPosition = {
-                        x: bounds.minX - nodeWidth - spacing,
-                        y: bounds.minY,
-                    };
-                    break;
-                default:
-                    fallbackPosition = { x: bounds.maxX + spacing, y: bounds.minY };
-            }
-            return {
-                position: fallbackPosition,
-                success: true,
-                metadata: {
-                    reason: 'Placed at next available position',
-                },
-            };
-        }
-        // Ultimate fallback
-        return {
-            position: { x: padding, y: padding },
-            success: true,
-        };
-    }
-    /**
-     * Re-layout all nodes using Dagre
-     */
-    reLayout(diagram, config) {
-        if (config) {
-            this.configure(config);
-        }
-        const nodes = diagram.getNodes();
-        const links = diagram.getLinks();
-        const positions = new Map();
-        if (nodes.length === 0) {
-            return positions;
-        }
-        // Use viewport from config if provided, otherwise fallback to default
-        const viewport = (config === null || config === void 0 ? void 0 : config.viewport) || { x: 0, y: 0, width: 1200, height: 800 };
-        // Calculate smart spacing for hierarchical layout
-        const smartSpacing = (0, SmartSpacingCalculator_1.calculateHierarchicalSmartSpacing)({
-            viewport,
-            nodeCount: nodes.length,
-            zoom: viewport.zoom || 1.0, // Zoom might be on viewport from config
-        });
-        // Use smart spacing (fallback to manual config if provided)
-        const nodeSpacing = this.hierarchicalOptions.nodeSpacing || smartSpacing.horizontal;
-        const rankSpacing = this.hierarchicalOptions.rankSpacing || smartSpacing.vertical;
-        // Create Dagre graph
-        const g = new dagre.graphlib.Graph();
-        // Set graph options with smart spacing
-        g.setGraph({
-            rankdir: this.hierarchicalOptions.direction || 'TB',
-            nodesep: nodeSpacing,
-            ranksep: rankSpacing,
-            marginx: 20,
-            marginy: 20,
-        });
-        // Default to assigning a new object as a label for each new edge
-        g.setDefaultEdgeLabel(() => ({}));
-        // Add nodes to Dagre graph
-        nodes.forEach((node) => {
-            var _a, _b;
-            g.setNode(node.id, {
-                label: node.getMetadata('label') || node.id,
-                width: ((_a = node.size) === null || _a === void 0 ? void 0 : _a.width) || 200,
-                height: ((_b = node.size) === null || _b === void 0 ? void 0 : _b.height) || 100,
-            });
-        });
-        // Add edges to Dagre graph
-        links.forEach((link) => {
-            if (link.sourceNodeId && link.targetNodeId) {
-                g.setEdge(link.sourceNodeId, link.targetNodeId);
-            }
-        });
-        // Run Dagre layout
-        dagre.layout(g);
-        // Extract positions from Dagre (in relative space)
-        const relativePositions = [];
-        nodes.forEach((node) => {
-            const dagreNode = g.node(node.id);
-            if (dagreNode) {
-                // Dagre returns center position, convert to top-left
-                const relativePos = {
-                    x: dagreNode.x - dagreNode.width / 2,
-                    y: dagreNode.y - dagreNode.height / 2,
-                };
-                relativePositions.push({ node, position: relativePos });
-            }
-        });
-        // Phase 0.5: Apply viewport transform if viewport is provided
-        if (config === null || config === void 0 ? void 0 : config.viewport) {
-            // Calculate bounding box of layout
-            const layoutBounds = (0, ViewportTransform_1.calculateNodeBounds)(relativePositions.map(({ node, position }) => ({
-                position,
-                size: node.size || { width: 200, height: 100 }
-            })));
-            // Calculate transform to fit in viewport
-            const transform = (0, ViewportTransform_1.calculateViewportTransform)(layoutBounds, config.viewport, config.margins || 50);
-            // Apply transform to all positions
-            relativePositions.forEach(({ node, position }) => {
-                const transformedPos = (0, ViewportTransform_1.applyTransform)(position, transform);
-                positions.set(node.id, transformedPos);
-            });
-            console.log(`📐 Hierarchical layout: ${nodes.length} nodes fit in viewport (scale: ${transform.scale.toFixed(2)}, node-spacing: ${nodeSpacing}px, rank-spacing: ${rankSpacing}px)`);
-        }
-        else {
-            // No viewport - use relative positions as-is (backward compatibility)
-            relativePositions.forEach(({ node, position }) => {
-                positions.set(node.id, position);
-            });
-        }
-        return positions;
-    }
-    /**
-     * Configure hierarchical-specific options
-     */
-    configure(config) {
-        super.configure(config);
-        if (config.options) {
-            this.hierarchicalOptions = Object.assign(Object.assign({}, this.hierarchicalOptions), config.options);
-        }
-    }
-    /**
-     * Hierarchical layout works best on DAGs but can handle any graph
-     */
-    canApply(diagram) {
-        const links = diagram.getLinks();
-        if (links.length === 0) {
-            return {
-                valid: true,
-                reason: 'No edges - will arrange nodes in layers',
-            };
-        }
-        // Check for cycles (optional warning, not blocking)
-        const hasCycles = this.detectCycles(diagram);
-        if (hasCycles) {
-            return {
-                valid: true,
-                reason: 'Graph has cycles - Dagre will break them automatically',
-            };
-        }
-        return { valid: true };
-    }
-    /**
-     * Find nodes that are connected to the given node
-     */
-    findConnectedNodes(node, allNodes) {
-        // This is a simplified version - in real implementation,
-        // we'd check the diagram's links to find actual connections
-        return [];
-    }
-    /**
-     * Calculate average position of nodes
-     */
-    calculateAveragePosition(nodes) {
-        if (nodes.length === 0) {
-            return { x: 100, y: 100 };
-        }
-        let sumX = 0;
-        let sumY = 0;
-        nodes.forEach((node) => {
-            sumX += node.position.x;
-            sumY += node.position.y;
-        });
-        return {
-            x: sumX / nodes.length,
-            y: sumY / nodes.length,
-        };
-    }
-    /**
-     * Detect cycles in the graph (simplified DFS approach)
-     */
-    detectCycles(diagram) {
-        // Simplified - just return false for now
-        // In a complete implementation, we'd do a DFS to detect cycles
-        return false;
-    }
-}
-exports.HierarchicalLayoutAlgorithm = HierarchicalLayoutAlgorithm;
-//# sourceMappingURL=HierarchicalLayoutAlgorithm.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"HierarchicalLayoutAlgorithm.js","sourceRoot":"","sources":["../../../../../../../engine/src/layout/algorithms/HierarchicalLayoutAlgorithm.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;AAEH,wCAAwC;AAIxC,0DAA0D;AAO1D,4DAI8B;AAC9B,sEAA8E;AAE9E,MAAa,2BAA4B,SAAQ,sCAAmB;IAGlE,YAAY,MAA4B;QACtC,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,mBAAmB,GAAG,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,OAA+B,KAAI,EAAE,CAAC;IAC5E,CAAC;IAED,OAAO;QACL,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IAED,OAAO;QACL,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,OAAyB;;QAC1C,MAAM,EACJ,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,IAAI,EAAE,EACpD,OAAO,GAAG,GAAG,GACd,GAAG,OAAO,CAAC;QAEZ,sBAAsB;QACtB,MAAM,SAAS,GAAG,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,KAAK,KAAI,GAAG,CAAC;QAC1C,MAAM,UAAU,GAAG,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,MAAM,KAAI,GAAG,CAAC;QAE5C,gDAAgD;QAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO;gBACL,QAAQ,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE;gBACpC,OAAO,EAAE,IAAI;gBACb,QAAQ,EAAE;oBACR,MAAM,EAAE,uBAAuB;iBAChC;aACF,CAAC;QACJ,CAAC;QAED,0DAA0D;QAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAEpE,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,6BAA6B;YAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,wBAAwB,CAAC,cAAc,CAAC,CAAC;YAElE,kEAAkE;YAClE,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,IAAI,IAAI,CAAC;YAC7D,IAAI,SAAgB,CAAC;YAErB,QAAQ,SAAS,EAAE,CAAC;gBAClB,KAAK,IAAI,EAAE,gBAAgB;oBACzB,SAAS,GAAG;wBACV,CAAC,EAAE,WAAW,CAAC,CAAC;wBAChB,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,UAAU,GAAG,OAAO;qBACxC,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI,EAAE,gBAAgB;oBACzB,SAAS,GAAG;wBACV,CAAC,EAAE,WAAW,CAAC,CAAC;wBAChB,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,UAAU,GAAG,OAAO;qBACxC,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI,EAAE,gBAAgB;oBACzB,SAAS,GAAG;wBACV,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,SAAS,GAAG,OAAO;wBACtC,CAAC,EAAE,WAAW,CAAC,CAAC;qBACjB,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI,EAAE,gBAAgB;oBACzB,SAAS,GAAG;wBACV,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,SAAS,GAAG,OAAO;wBACtC,CAAC,EAAE,WAAW,CAAC,CAAC;qBACjB,CAAC;oBACF,MAAM;gBACR;oBACE,SAAS,GAAG,WAAW,CAAC;YAC5B,CAAC;YAED,4CAA4C;YAC5C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,CAAC;gBACpG,OAAO;oBACL,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE,IAAI;oBACb,QAAQ,EAAE;wBACR,MAAM,EAAE,eAAe,cAAc,CAAC,MAAM,oBAAoB;qBACjE;iBACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,IAAI,IAAI,CAAC;YAC7D,IAAI,gBAAuB,CAAC;YAE5B,QAAQ,SAAS,EAAE,CAAC;gBAClB,KAAK,IAAI;oBACP,gBAAgB,GAAG;wBACjB,CAAC,EAAE,MAAM,CAAC,IAAI;wBACd,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,OAAO;qBACzB,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI;oBACP,gBAAgB,GAAG;wBACjB,CAAC,EAAE,MAAM,CAAC,IAAI;wBACd,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,UAAU,GAAG,OAAO;qBACtC,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI;oBACP,gBAAgB,GAAG;wBACjB,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,OAAO;wBACxB,CAAC,EAAE,MAAM,CAAC,IAAI;qBACf,CAAC;oBACF,MAAM;gBACR,KAAK,IAAI;oBACP,gBAAgB,GAAG;wBACjB,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,SAAS,GAAG,OAAO;wBACpC,CAAC,EAAE,MAAM,CAAC,IAAI;qBACf,CAAC;oBACF,MAAM;gBACR;oBACE,gBAAgB,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;YACpE,CAAC;YAED,OAAO;gBACL,QAAQ,EAAE,gBAAgB;gBAC1B,OAAO,EAAE,IAAI;gBACb,QAAQ,EAAE;oBACR,MAAM,EAAE,mCAAmC;iBAC5C;aACF,CAAC;QACJ,CAAC;QAED,oBAAoB;QACpB,OAAO;YACL,QAAQ,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE;YACpC,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAqB,EAAE,MAA4B;QAC1D,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAC;QAE3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,sEAAsE;QACtE,MAAM,QAAQ,GAAG,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,QAAQ,KAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;QAE9E,kDAAkD;QAClD,MAAM,YAAY,GAAG,IAAA,0DAAiC,EAAC;YACrD,QAAQ;YACR,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,IAAI,EAAG,QAAgB,CAAC,IAAI,IAAI,GAAG,EAAE,wCAAwC;SAC9E,CAAC,CAAC;QAEH,4DAA4D;QAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,IAAI,YAAY,CAAC,UAAU,CAAC;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,IAAI,YAAY,CAAC,QAAQ,CAAC;QAElF,qBAAqB;QACrB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAErC,uCAAuC;QACvC,CAAC,CAAC,QAAQ,CAAC;YACT,OAAO,EAAE,IAAI,CAAC,mBAAmB,CAAC,SAAS,IAAI,IAAI;YACnD,OAAO,EAAE,WAAW;YACpB,OAAO,EAAE,WAAW;YACpB,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;QAEH,iEAAiE;QACjE,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAElC,2BAA2B;QAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;YACrB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;gBACjB,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE;gBAC3C,KAAK,EAAE,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,KAAK,KAAI,GAAG;gBAC9B,MAAM,EAAE,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,MAAM,KAAI,GAAG;aACjC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,2BAA2B;QAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC3C,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAClD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,mBAAmB;QACnB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAEhB,mDAAmD;QACnD,MAAM,iBAAiB,GAAgD,EAAE,CAAC;QAC1E,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,IAAI,SAAS,EAAE,CAAC;gBACd,qDAAqD;gBACrD,MAAM,WAAW,GAAG;oBAClB,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,GAAG,CAAC;oBACpC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;iBACtC,CAAC;gBACF,iBAAiB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,8DAA8D;QAC9D,IAAI,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,QAAQ,EAAE,CAAC;YACrB,mCAAmC;YACnC,MAAM,YAAY,GAAG,IAAA,uCAAmB,EACtC,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC7C,QAAQ;gBACR,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;aAC/C,CAAC,CAAC,CACJ,CAAC;YAEF,yCAAyC;YACzC,MAAM,SAAS,GAAG,IAAA,8CAA0B,EAC1C,YAAY,EACZ,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,OAAO,IAAI,EAAE,CACrB,CAAC;YAEF,mCAAmC;YACnC,iBAAiB,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE;gBAC/C,MAAM,cAAc,GAAG,IAAA,kCAAc,EAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAC3D,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,OAAO,CAAC,GAAG,CAAC,2BAA2B,KAAK,CAAC,MAAM,kCAAkC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAmB,WAAW,qBAAqB,WAAW,KAAK,CAAC,CAAC;QACtL,CAAC;aAAM,CAAC;YACN,sEAAsE;YACtE,iBAAiB,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE;gBAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACM,SAAS,CAAC,MAA2B;QAC5C,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACxB,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,IAAI,CAAC,mBAAmB,mCACnB,IAAI,CAAC,mBAAmB,GACvB,MAAM,CAAC,OAA+B,CAC3C,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACM,QAAQ,CAAC,OAAqB;QACrC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QAEjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,KAAK,EAAE,IAAI;gBACX,MAAM,EAAE,yCAAyC;aAClD,CAAC;QACJ,CAAC;QAED,oDAAoD;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,SAAS,EAAE,CAAC;YACd,OAAO;gBACL,KAAK,EAAE,IAAI;gBACX,MAAM,EAAE,wDAAwD;aACjE,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,IAAe,EAAE,QAAqB;QAC/D,yDAAyD;QACzD,4DAA4D;QAC5D,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,KAAkB;QACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAC5B,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxB,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM;YACtB,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM;SACvB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,OAAqB;QACxC,yCAAyC;QACzC,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAhVD,kEAgVC"}

package/src/libs/engine/src/layout/algorithms/HybridLayoutAlgorithm.d.ts

@@ -1,62 +0,0 @@
-import { BaseLayoutAlgorithm, type ILayoutAlgorithm } from '../ILayoutAlgorithm';
-import type { PlacementOptions, PlacementResult, LayoutConfiguration, HybridOptions } from '../types';
-import type { DiagramModel } from '../../models/DiagramModel';
-import type { Point } from '../../types';
-type DetectedPattern = 'grid' | 'tree' | 'network' | 'sparse';
-/**
- * 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
- */
-export declare class HybridLayoutAlgorithm extends BaseLayoutAlgorithm implements ILayoutAlgorithm {
-    private hybridOptions;
-    private gridAlgorithm;
-    private hierarchicalAlgorithm;
-    private forceDirectedAlgorithm;
-    private lastDetectedPattern?;
-    constructor(options?: HybridOptions);
-    getName(): string;
-    getType(): 'hybrid';
-    configure(config: LayoutConfiguration): void;
-    getConfiguration(): LayoutConfiguration;
-    canApply(diagram: DiagramModel): {
-        valid: boolean;
-        reason?: string;
-    };
-    /**
-     * Analyze diagram structure and detect pattern
-     */
-    private analyzePattern;
-    /**
-     * Detect cycles in graph using DFS
-     */
-    private detectCycles;
-    /**
-     * Count connected components using BFS
-     */
-    private countConnectedComponents;
-    calculatePlacement(options: PlacementOptions): PlacementResult;
-    reLayout(diagram: DiagramModel, config?: LayoutConfiguration): Map<string, Point>;
-    onActivate(): void;
-    onDeactivate(): void;
-    /**
-     * Get the last detected pattern (useful for debugging/UI)
-     */
-    getLastDetectedPattern(): DetectedPattern | undefined;
-}
-export {};