@antv/layout 1.2.14-beta.9 → 2.0.0-alpha.2

package/lib/algorithm/antv-dagre/graph.js

@@ -0,0 +1,429 @@
+/**
+ * <zh/> 内部图数据结构，用于 antv-dagre 布局算法
+ *
+ * <en/> Internal graph data structure for antv-dagre layout algorithm
+ */
+class DagreGraph {
+    constructor(options = {}) {
+        this.options = options;
+        this.nodes = new Map();
+        this.edges = new Map();
+        this.inEdges = new Map();
+        this.outEdges = new Map();
+        this.parentMap = new Map(); // tree structure name -> node -> parent
+        this.childrenMap = new Map(); // tree structure name -> node -> children
+        // Initialize tree structures
+        if (options.tree) {
+            if (Array.isArray(options.tree) && options.tree.length > 0) {
+                // Check if it's a tree name array or tree data array
+                if (typeof options.tree[0] === 'string') {
+                    // It's a tree name array
+                    options.tree.forEach((treeName) => {
+                        this.parentMap.set(treeName, new Map());
+                        this.childrenMap.set(treeName, new Map());
+                    });
+                }
+                else {
+                    // It's tree data, add it
+                    this.attachTreeStructure('default');
+                    this.addTree(options.tree);
+                }
+            }
+        }
+        // Add initial nodes and edges if provided
+        if (options.nodes) {
+            options.nodes.forEach((node) => this.addNode(node));
+        }
+        if (options.edges) {
+            options.edges.forEach((edge) => this.addEdge(edge));
+        }
+    }
+    /**
+     * <zh/> 添加节点
+     *
+     * <en/> Add a node
+     */
+    addNode(node) {
+        if (!this.nodes.has(node.id)) {
+            this.nodes.set(node.id, node);
+            this.inEdges.set(node.id, new Set());
+            this.outEdges.set(node.id, new Set());
+        }
+    }
+    /**
+     * <zh/> 批量添加节点
+     *
+     * <en/> Add multiple nodes
+     */
+    addNodes(nodes) {
+        nodes.forEach((node) => this.addNode(node));
+    }
+    /**
+     * <zh/> 获取节点
+     *
+     * <en/> Get a node
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * <zh/> 检查节点是否存在
+     *
+     * <en/> Check if a node exists
+     */
+    hasNode(id) {
+        return this.nodes.has(id);
+    }
+    /**
+     * <zh/> 删除节点
+     *
+     * <en/> Remove a node
+     */
+    removeNode(id) {
+        if (!this.nodes.has(id))
+            return;
+        // Remove all edges connected to this node
+        const inEdgeIds = Array.from(this.inEdges.get(id) || []);
+        const outEdgeIds = Array.from(this.outEdges.get(id) || []);
+        inEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));
+        outEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));
+        this.nodes.delete(id);
+        this.inEdges.delete(id);
+        this.outEdges.delete(id);
+        // Remove from tree structures
+        this.parentMap.forEach((treeParentMap) => {
+            treeParentMap.delete(id);
+        });
+        this.childrenMap.forEach((treeChildrenMap) => {
+            treeChildrenMap.delete(id);
+        });
+    }
+    /**
+     * <zh/> 获取所有节点
+     *
+     * <en/> Get all nodes
+     */
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    /**
+     * <zh/> 添加边
+     *
+     * <en/> Add an edge
+     */
+    addEdge(edge) {
+        if (!this.nodes.has(edge.source) || !this.nodes.has(edge.target)) {
+            throw new Error(`Cannot add edge ${edge.id}: source ${edge.source} or target ${edge.target} does not exist`);
+        }
+        this.edges.set(edge.id, edge);
+        this.outEdges.get(edge.source).add(edge.id);
+        this.inEdges.get(edge.target).add(edge.id);
+    }
+    /**
+     * <zh/> 批量添加边
+     *
+     * <en/> Add multiple edges
+     */
+    addEdges(edges) {
+        edges.forEach((edge) => this.addEdge(edge));
+    }
+    /**
+     * <zh/> 获取边
+     *
+     * <en/> Get an edge
+     */
+    getEdge(id) {
+        return this.edges.get(id);
+    }
+    /**
+     * <zh/> 检查边是否存在
+     *
+     * <en/> Check if an edge exists
+     */
+    hasEdge(id) {
+        return this.edges.has(id);
+    }
+    /**
+     * <zh/> 删除边
+     *
+     * <en/> Remove an edge
+     */
+    removeEdge(id) {
+        var _a, _b;
+        const edge = this.edges.get(id);
+        if (!edge)
+            return;
+        this.edges.delete(id);
+        (_a = this.outEdges.get(edge.source)) === null || _a === void 0 ? void 0 : _a.delete(id);
+        (_b = this.inEdges.get(edge.target)) === null || _b === void 0 ? void 0 : _b.delete(id);
+    }
+    /**
+     * <zh/> 获取所有边
+     *
+     * <en/> Get all edges
+     */
+    getAllEdges() {
+        return Array.from(this.edges.values());
+    }
+    /**
+     * <zh/> 更新边数据
+     *
+     * <en/> Update edge data
+     */
+    updateEdgeData(id, data) {
+        const edge = this.edges.get(id);
+        if (edge) {
+            Object.assign(edge.data, data);
+        }
+    }
+    /**
+     * <zh/> 更新节点数据
+     *
+     * <en/> Update node data
+     */
+    updateNodeData(id, data) {
+        const node = this.nodes.get(id);
+        if (node) {
+            Object.assign(node.data, data);
+        }
+    }
+    /**
+     * <zh/> 获取相关边
+     *
+     * <en/> Get related edges
+     */
+    getRelatedEdges(nodeId, direction = 'both') {
+        const result = [];
+        if (direction === 'in' || direction === 'both') {
+            const inEdgeIds = this.inEdges.get(nodeId);
+            if (inEdgeIds) {
+                inEdgeIds.forEach((edgeId) => {
+                    const edge = this.edges.get(edgeId);
+                    if (edge)
+                        result.push(edge);
+                });
+            }
+        }
+        if (direction === 'out' || direction === 'both') {
+            const outEdgeIds = this.outEdges.get(nodeId);
+            if (outEdgeIds) {
+                outEdgeIds.forEach((edgeId) => {
+                    const edge = this.edges.get(edgeId);
+                    if (edge)
+                        result.push(edge);
+                });
+            }
+        }
+        return result;
+    }
+    /**
+     * <zh/> 获取后继节点
+     *
+     * <en/> Get successor nodes
+     */
+    getSuccessors(nodeId) {
+        const outEdgeIds = this.outEdges.get(nodeId);
+        if (!outEdgeIds || outEdgeIds.size === 0)
+            return [];
+        const successors = [];
+        outEdgeIds.forEach((edgeId) => {
+            const edge = this.edges.get(edgeId);
+            if (edge) {
+                const targetNode = this.nodes.get(edge.target);
+                if (targetNode)
+                    successors.push(targetNode);
+            }
+        });
+        return successors.length > 0 ? successors : [];
+    }
+    /**
+     * <zh/> 获取前驱节点
+     *
+     * <en/> Get predecessor nodes
+     */
+    getPredecessors(nodeId) {
+        const inEdgeIds = this.inEdges.get(nodeId);
+        if (!inEdgeIds || inEdgeIds.size === 0)
+            return [];
+        const predecessors = [];
+        inEdgeIds.forEach((edgeId) => {
+            const edge = this.edges.get(edgeId);
+            if (edge) {
+                const sourceNode = this.nodes.get(edge.source);
+                if (sourceNode)
+                    predecessors.push(sourceNode);
+            }
+        });
+        return predecessors.length > 0 ? predecessors : [];
+    }
+    /**
+     * <zh/> 获取邻居节点
+     *
+     * <en/> Get neighbor nodes
+     */
+    getNeighbors(nodeId) {
+        const successors = this.getSuccessors(nodeId) || [];
+        const predecessors = this.getPredecessors(nodeId) || [];
+        const neighbors = [...successors, ...predecessors];
+        // Remove duplicates
+        const uniqueNeighbors = Array.from(new Map(neighbors.map((n) => [n.id, n])).values());
+        return uniqueNeighbors.length > 0 ? uniqueNeighbors : [];
+    }
+    /**
+     * <zh/> 附加树结构
+     *
+     * <en/> Attach tree structure
+     */
+    attachTreeStructure(treeName) {
+        if (!this.parentMap.has(treeName)) {
+            this.parentMap.set(treeName, new Map());
+            this.childrenMap.set(treeName, new Map());
+        }
+    }
+    /**
+     * <zh/> 添加树结构（递归添加节点及其子节点）
+     *
+     * <en/> Add tree structure (recursively add nodes and their children)
+     */
+    addTree(tree, treeName) {
+        var _a, _b;
+        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');
+        if (!this.hasTreeStructure(actualTreeName)) {
+            this.attachTreeStructure(actualTreeName);
+        }
+        const trees = Array.isArray(tree) ? tree : [tree];
+        const addTreeNode = (node, parentId) => {
+            // Add the node itself
+            this.addNode({ id: node.id, data: node.data });
+            // Set parent relationship if parent exists
+            if (parentId !== undefined) {
+                this.setParent(node.id, parentId, actualTreeName);
+            }
+            // Recursively add children
+            if (node.children && node.children.length > 0) {
+                node.children.forEach((child) => {
+                    addTreeNode(child, node.id);
+                });
+            }
+        };
+        trees.forEach((t) => addTreeNode(t));
+    }
+    /**
+     * <zh/> 检查是否有树结构
+     *
+     * <en/> Check if has tree structure
+     */
+    hasTreeStructure(treeName) {
+        return this.parentMap.has(treeName);
+    }
+    /**
+     * <zh/> 设置父节点
+     *
+     * <en/> Set parent node
+     */
+    setParent(childId, parentId, treeName) {
+        var _a, _b, _c;
+        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');
+        if (!this.parentMap.has(actualTreeName)) {
+            this.attachTreeStructure(actualTreeName);
+        }
+        const treeParentMap = this.parentMap.get(actualTreeName);
+        const treeChildrenMap = this.childrenMap.get(actualTreeName);
+        // Remove from old parent
+        const oldParent = treeParentMap.get(childId);
+        if (oldParent !== undefined) {
+            (_c = treeChildrenMap.get(oldParent)) === null || _c === void 0 ? void 0 : _c.delete(childId);
+        }
+        // Set new parent
+        treeParentMap.set(childId, parentId);
+        // Add to new parent's children
+        if (!treeChildrenMap.has(parentId)) {
+            treeChildrenMap.set(parentId, new Set());
+        }
+        treeChildrenMap.get(parentId).add(childId);
+    }
+    /**
+     * <zh/> 获取父节点
+     *
+     * <en/> Get parent node
+     */
+    getParent(nodeId, treeName) {
+        var _a, _b;
+        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');
+        // Ensure tree structure exists
+        if (!this.parentMap.has(actualTreeName)) {
+            this.attachTreeStructure(actualTreeName);
+        }
+        const treeParentMap = this.parentMap.get(actualTreeName);
+        if (!treeParentMap)
+            return undefined;
+        const parentId = treeParentMap.get(nodeId);
+        if (parentId === undefined) {
+            // Node has no parent set
+            return null;
+        }
+        return this.nodes.get(parentId);
+    }
+    /**
+     * <zh/> 获取子节点
+     *
+     * <en/> Get children nodes
+     */
+    getChildren(nodeId, treeName) {
+        var _a, _b;
+        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');
+        const treeChildrenMap = this.childrenMap.get(actualTreeName);
+        if (!treeChildrenMap)
+            return [];
+        const childIds = treeChildrenMap.get(nodeId);
+        if (!childIds)
+            return [];
+        return Array.from(childIds)
+            .map((id) => this.nodes.get(id))
+            .filter((node) => node !== undefined);
+    }
+    /**
+     * <zh/> 获取根节点（没有父节点的节点）
+     *
+     * <en/> Get root nodes (nodes without parents)
+     */
+    getRoots(treeName) {
+        var _a, _b;
+        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');
+        const treeParentMap = this.parentMap.get(actualTreeName);
+        const roots = [];
+        this.nodes.forEach((node) => {
+            const hasParent = treeParentMap && treeParentMap.get(node.id) !== undefined;
+            if (!hasParent) {
+                roots.push(node);
+            }
+        });
+        return roots;
+    }
+    dfsTree(startId, visit) {
+        const stack = [startId];
+        const visited = new Set();
+        while (stack.length > 0) {
+            const nodeId = stack.pop();
+            if (visited.has(nodeId))
+                continue;
+            const node = this.getNode(nodeId);
+            if (node) {
+                visited.add(nodeId);
+                const shouldSkipChildren = visit(node);
+                if (shouldSkipChildren === true)
+                    continue;
+                const children = this.getChildren(nodeId);
+                // Push children in reverse order so they are processed in the correct order
+                for (let i = children.length - 1; i >= 0; i--) {
+                    if (!visited.has(children[i].id)) {
+                        stack.push(children[i].id);
+                    }
+                }
+            }
+        }
+    }
+}
+
+export { DagreGraph };
+//# sourceMappingURL=graph.js.map

package/lib/algorithm/antv-dagre/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/graph.ts"],"sourcesContent":[null],"names":[],"mappings":"AAsCA;;;;AAIG;MACU,UAAU,CAAA;AAWrB,IAAA,WAAA,CAAoB,UAA8B,EAAE,EAAA;QAAhC,IAAA,CAAA,OAAO,GAAP,OAAO;AAPnB,QAAA,IAAA,CAAA,KAAK,GAA0B,IAAI,GAAG,EAAE;AACxC,QAAA,IAAA,CAAA,KAAK,GAA0B,IAAI,GAAG,EAAE;AACxC,QAAA,IAAA,CAAA,OAAO,GAAqB,IAAI,GAAG,EAAE;AACrC,QAAA,IAAA,CAAA,QAAQ,GAAqB,IAAI,GAAG,EAAE;AACtC,QAAA,IAAA,CAAA,SAAS,GAAyC,IAAI,GAAG,EAAE,CAAC;AAC5D,QAAA,IAAA,CAAA,WAAW,GAAkC,IAAI,GAAG,EAAE,CAAC;;QAI7D,IAAI,OAAO,CAAC,IAAI,EAAE;AAChB,YAAA,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;;gBAE1D,IAAI,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE;;oBAEtC,OAAO,CAAC,IAAiB,CAAC,OAAO,CAAC,CAAC,QAAQ,KAAI;wBAC9C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC;wBACvC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC;AAC3C,oBAAA,CAAC,CAAC;AACH,gBAAA;AAAM,qBAAA;;AAEL,oBAAA,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;AACnC,oBAAA,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAW,CAAC;AAClC,gBAAA;AACF,YAAA;AACF,QAAA;;QAGD,IAAI,OAAO,CAAC,KAAK,EAAE;AACjB,YAAA,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACpD,QAAA;QACD,IAAI,OAAO,CAAC,KAAK,EAAE;AACjB,YAAA,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACpD,QAAA;IACH;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,IAAkB,EAAA;QACxB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;AAC7B,YAAA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC;AACpC,YAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC;AACtC,QAAA;IACH;AAEA;;;;AAIG;AACH,IAAA,QAAQ,CAAC,KAAqB,EAAA;AAC5B,QAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7C;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,EAAM,EAAA;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE;IAC5B;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,EAAM,EAAA;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IAC3B;AAEA;;;;AAIG;AACH,IAAA,UAAU,CAAC,EAAM,EAAA;QACf,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE;;AAGzB,QAAA,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AACxD,QAAA,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAE1D,QAAA,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AACtD,QAAA,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAEvD,QAAA,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;AACrB,QAAA,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;AACvB,QAAA,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;;QAGxB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,aAAa,KAAI;AACvC,YAAA,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;AAC1B,QAAA,CAAC,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,eAAe,KAAI;AAC3C,YAAA,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;AAC5B,QAAA,CAAC,CAAC;IACJ;AAEA;;;;AAIG;IACH,WAAW,GAAA;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IACxC;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,IAAkB,EAAA;QACxB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;AAChE,YAAA,MAAM,IAAI,KAAK,CACb,CAAA,gBAAA,EAAmB,IAAI,CAAC,EAAE,CAAA,SAAA,EAAY,IAAI,CAAC,MAAM,CAAA,WAAA,EAAc,IAAI,CAAC,MAAM,CAAA,eAAA,CAAiB,CAC5F;AACF,QAAA;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;AAC7B,QAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5C,QAAA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IAC7C;AAEA;;;;AAIG;AACH,IAAA,QAAQ,CAAC,KAAqB,EAAA;AAC5B,QAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7C;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,EAAM,EAAA;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE;IAC5B;AAEA;;;;AAIG;AACH,IAAA,OAAO,CAAC,EAAM,EAAA;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IAC3B;AAEA;;;;AAIG;AACH,IAAA,UAAU,CAAC,EAAM,EAAA;;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;AAC/B,QAAA,IAAI,CAAC,IAAI;YAAE;AAEX,QAAA,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;AACrB,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,CAAC,EAAE,CAAC;AAC1C,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,CAAC,EAAE,CAAC;IAC3C;AAEA;;;;AAIG;IACH,WAAW,GAAA;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IACxC;AAEA;;;;AAIG;IACH,cAAc,CAAC,EAAM,EAAE,IAAgB,EAAA;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;AAC/B,QAAA,IAAI,IAAI,EAAE;YACR,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AAC/B,QAAA;IACH;AAEA;;;;AAIG;IACH,cAAc,CAAC,EAAM,EAAE,IAAgB,EAAA;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;AAC/B,QAAA,IAAI,IAAI,EAAE;YACR,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AAC/B,QAAA;IACH;AAEA;;;;AAIG;AACH,IAAA,eAAe,CACb,MAAU,EACV,SAAA,GAAmC,MAAM,EAAA;QAEzC,MAAM,MAAM,GAAmB,EAAE;AAEjC,QAAA,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE;YAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;AAC1C,YAAA,IAAI,SAAS,EAAE;AACb,gBAAA,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;oBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;AACnC,oBAAA,IAAI,IAAI;AAAE,wBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,gBAAA,CAAC,CAAC;AACH,YAAA;AACF,QAAA;AAED,QAAA,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE;YAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;AAC5C,YAAA,IAAI,UAAU,EAAE;AACd,gBAAA,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;oBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;AACnC,oBAAA,IAAI,IAAI;AAAE,wBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,gBAAA,CAAC,CAAC;AACH,YAAA;AACF,QAAA;AAED,QAAA,OAAO,MAAM;IACf;AAEA;;;;AAIG;AACH,IAAA,aAAa,CAAC,MAAU,EAAA;QACtB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;AAC5C,QAAA,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;AAAE,YAAA,OAAO,EAAE;QAEnD,MAAM,UAAU,GAAmB,EAAE;AACrC,QAAA,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;AACnC,YAAA,IAAI,IAAI,EAAE;AACR,gBAAA,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC9C,gBAAA,IAAI,UAAU;AAAE,oBAAA,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC;AAC5C,YAAA;AACH,QAAA,CAAC,CAAC;AAEF,QAAA,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,UAAU,GAAG,EAAE;IAChD;AAEA;;;;AAIG;AACH,IAAA,eAAe,CAAC,MAAU,EAAA;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;AAC1C,QAAA,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;AAAE,YAAA,OAAO,EAAE;QAEjD,MAAM,YAAY,GAAmB,EAAE;AACvC,QAAA,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;AACnC,YAAA,IAAI,IAAI,EAAE;AACR,gBAAA,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC9C,gBAAA,IAAI,UAAU;AAAE,oBAAA,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;AAC9C,YAAA;AACH,QAAA,CAAC,CAAC;AAEF,QAAA,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,YAAY,GAAG,EAAE;IACpD;AAEA;;;;AAIG;AACH,IAAA,YAAY,CAAC,MAAU,EAAA;QACrB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,EAAE;QACnD,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE;QACvD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,YAAY,CAAC;;AAGlD,QAAA,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAChC,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAClD;AAED,QAAA,OAAO,eAAe,CAAC,MAAM,GAAG,CAAC,GAAG,eAAe,GAAG,EAAE;IAC1D;AAEA;;;;AAIG;AACH,IAAA,mBAAmB,CAAC,QAAgB,EAAA;QAClC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC;AAC1C,QAAA;IACH;AAEA;;;;AAIG;IACH,OAAO,CACL,IAEoD,EACpD,QAAiB,EAAA;;AAEjB,QAAA,MAAM,cAAc,GAClB,QAAQ,KAAM,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,SAAS,CAAY;AAE/D,QAAA,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAAE;AAC1C,YAAA,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC;AACzC,QAAA;AAED,QAAA,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;AAEjD,QAAA,MAAM,WAAW,GAAG,CAClB,IAAkD,EAClD,QAAa,KACX;;AAEF,YAAA,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;;YAG9C,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,cAAc,CAAC;AAClD,YAAA;;YAGD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC7C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;AAC9B,oBAAA,WAAW,CAAC,KAAY,EAAE,IAAI,CAAC,EAAE,CAAC;AACpC,gBAAA,CAAC,CAAC;AACH,YAAA;AACH,QAAA,CAAC;AAED,QAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACtC;AAEA;;;;AAIG;AACH,IAAA,gBAAgB,CAAC,QAAgB,EAAA;QAC/B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;IACrC;AAEA;;;;AAIG;AACH,IAAA,SAAS,CAAC,OAAW,EAAE,QAAY,EAAE,QAAiB,EAAA;;AACpD,QAAA,MAAM,cAAc,GAClB,QAAQ,KAAM,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,SAAS,CAAY;QAE/D,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE;AACvC,YAAA,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC;AACzC,QAAA;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAE;QACzD,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAE;;QAG7D,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;QAC5C,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,CAAA,EAAA,GAAA,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,CAAC,OAAO,CAAC;AAChD,QAAA;;AAGD,QAAA,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC;;AAGpC,QAAA,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAClC,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC;AACzC,QAAA;QACD,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,OAAO,CAAC;IAC7C;AAEA;;;;AAIG;IACH,SAAS,CAAC,MAAU,EAAE,QAAiB,EAAA;;AACrC,QAAA,MAAM,cAAc,GAClB,QAAQ,KAAM,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,SAAS,CAAY;;QAG/D,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE;AACvC,YAAA,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC;AACzC,QAAA;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC;AAExD,QAAA,IAAI,CAAC,aAAa;AAAE,YAAA,OAAO,SAAS;QAEpC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE;;AAE1B,YAAA,OAAO,IAAI;AACZ,QAAA;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;IACjC;AAEA;;;;AAIG;IACH,WAAW,CAAC,MAAU,EAAE,QAAiB,EAAA;;AACvC,QAAA,MAAM,cAAc,GAClB,QAAQ,KAAM,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,SAAS,CAAY;QAC/D,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;AAE5D,QAAA,IAAI,CAAC,eAAe;AAAE,YAAA,OAAO,EAAE;QAE/B,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;AAC5C,QAAA,IAAI,CAAC,QAAQ;AAAE,YAAA,OAAO,EAAE;AAExB,QAAA,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ;AACvB,aAAA,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;aAC9B,MAAM,CAAC,CAAC,IAAI,KAA2B,IAAI,KAAK,SAAS,CAAC;IAC/D;AAEA;;;;AAIG;AACH,IAAA,QAAQ,CAAC,QAAiB,EAAA;;AACxB,QAAA,MAAM,cAAc,GAClB,QAAQ,KAAM,CAAA,EAAA,GAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,SAAS,CAAY;QAC/D,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC;QAExD,MAAM,KAAK,GAAmB,EAAE;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AAC1B,YAAA,MAAM,SAAS,GACb,aAAa,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS;YAC3D,IAAI,CAAC,SAAS,EAAE;AACd,gBAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AACjB,YAAA;AACH,QAAA,CAAC,CAAC;AAEF,QAAA,OAAO,KAAK;IACd;IAEA,OAAO,CAAC,OAAW,EAAE,KAA6C,EAAA;AAChE,QAAA,MAAM,KAAK,GAAS,CAAC,OAAO,CAAC;AAC7B,QAAA,MAAM,OAAO,GAAY,IAAI,GAAG,EAAE;AAElC,QAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACvB,YAAA,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG;AAC3B,YAAA,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE;YAEzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;AACjC,YAAA,IAAI,IAAI,EAAE;AACR,gBAAA,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;AACnB,gBAAA,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC;gBACtC,IAAI,kBAAkB,KAAK,IAAI;oBAAE;gBAEjC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;;AAEzC,gBAAA,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC7C,oBAAA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;wBAChC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3B,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;IACH;AACD;;;;"}

package/lib/algorithm/antv-dagre/greedy-fas.js

@@ -0,0 +1,139 @@
+import List$1 from './data/list.js';
+import { DagreGraph } from './graph.js';
+
+/*
+ * A greedy heuristic for finding a feedback arc set for a graph. A feedback
+ * arc set is a set of edges that can be removed to make a graph acyclic.
+ * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
+ * effective heuristic for the feedback arc set problem." This implementation
+ * adjusts that from the paper to allow for weighted edges.
+ *
+ * @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js
+ */
+class List extends List$1 {
+}
+const DEFAULT_WEIGHT_FN = () => 1;
+const greedyFAS = (g, weightFn) => {
+    var _a;
+    if (g.getAllNodes().length <= 1)
+        return [];
+    const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+    const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
+    return (_a = results
+        .map((e) => g.getRelatedEdges(e.v, 'out').filter(({ target }) => target === e.w))) === null || _a === void 0 ? void 0 : _a.flat();
+};
+const doGreedyFAS = (g, buckets, zeroIdx) => {
+    let results = [];
+    const sources = buckets[buckets.length - 1];
+    const sinks = buckets[0];
+    let entry;
+    while (g.getAllNodes().length) {
+        while ((entry = sinks.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        while ((entry = sources.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        if (g.getAllNodes().length) {
+            for (let i = buckets.length - 2; i > 0; --i) {
+                entry = buckets[i].dequeue();
+                if (entry) {
+                    results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+                    break;
+                }
+            }
+        }
+    }
+    return results;
+};
+const removeNode = (g, buckets, zeroIdx, entry, collectPredecessors) => {
+    var _a, _b;
+    const results = [];
+    if (g.hasNode(entry.v)) {
+        (_a = g.getRelatedEdges(entry.v, 'in')) === null || _a === void 0 ? void 0 : _a.forEach((edge) => {
+            const weight = edge.data.weight;
+            const uEntry = g.getNode(edge.source);
+            if (collectPredecessors) {
+                // this result not really care about in or out
+                results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });
+            }
+            if (uEntry.data.out === undefined)
+                uEntry.data.out = 0;
+            // @ts-ignore
+            uEntry.data.out -= weight;
+            assignBucket(buckets, zeroIdx, Object.assign({ v: uEntry.id }, uEntry.data));
+        });
+        (_b = g.getRelatedEdges(entry.v, 'out')) === null || _b === void 0 ? void 0 : _b.forEach((edge) => {
+            const weight = edge.data.weight;
+            const w = edge.target;
+            const wEntry = g.getNode(w);
+            if (wEntry.data.in === undefined)
+                wEntry.data.in = 0;
+            // @ts-ignore
+            wEntry.data.in -= weight;
+            assignBucket(buckets, zeroIdx, Object.assign({ v: wEntry.id }, wEntry.data));
+        });
+        g.removeNode(entry.v);
+    }
+    return collectPredecessors ? results : undefined;
+};
+const buildState = (g, weightFn) => {
+    const fasGraph = new DagreGraph();
+    let maxIn = 0;
+    let maxOut = 0;
+    g.getAllNodes().forEach((v) => {
+        fasGraph.addNode({
+            id: v.id,
+            data: { v: v.id, in: 0, out: 0 },
+        });
+    });
+    // Aggregate weights on nodes, but also sum the weights across multi-edges
+    // into a single edge for the fasGraph.
+    g.getAllEdges().forEach((e) => {
+        const edge = fasGraph
+            .getRelatedEdges(e.source, 'out')
+            .find((edge) => edge.target === e.target);
+        const weight = (weightFn === null || weightFn === void 0 ? void 0 : weightFn(e)) || 1;
+        if (!edge) {
+            fasGraph.addEdge({
+                id: e.id,
+                source: e.source,
+                target: e.target,
+                data: {
+                    weight,
+                },
+            });
+        }
+        else {
+            fasGraph.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + weight }));
+        }
+        // @ts-ignore
+        maxOut = Math.max(maxOut, (fasGraph.getNode(e.source).data.out += weight));
+        // @ts-ignore
+        maxIn = Math.max(maxIn, (fasGraph.getNode(e.target).data.in += weight));
+    });
+    const buckets = [];
+    const rangeMax = maxOut + maxIn + 3;
+    for (let i = 0; i < rangeMax; i++) {
+        buckets.push(new List());
+    }
+    const zeroIdx = maxIn + 1;
+    fasGraph.getAllNodes().forEach((v) => {
+        assignBucket(buckets, zeroIdx, Object.assign({ v: v.id }, fasGraph.getNode(v.id).data));
+    });
+    return { buckets, zeroIdx, graph: fasGraph };
+};
+const assignBucket = (buckets, zeroIdx, entry) => {
+    if (!entry.out) {
+        buckets[0].enqueue(entry);
+    }
+    else if (!entry['in']) {
+        buckets[buckets.length - 1].enqueue(entry);
+    }
+    else {
+        buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);
+    }
+};
+
+export { greedyFAS };
+//# sourceMappingURL=greedy-fas.js.map

package/lib/algorithm/antv-dagre/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/greedy-fas.ts"],"sourcesContent":[null],"names":["RawList"],"mappings":";;;AAAA;;;;;;;;AAQG;AAcH,MAAM,IAAK,SAAQA,MAAkB,CAAA;AAAG;AAExC,MAAM,iBAAiB,GAAG,MAAM,CAAC;MAEpB,SAAS,GAAG,CACvB,CAAa,EACb,QAA6C,KAC3C;;AACF,IAAA,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,EAAE;IAC1C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC;AAC1D,IAAA,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;AAEtE,IAAA,OAAO,MAAA;AACJ,SAAA,GAAG,CAAC,CAAC,CAAC,KACL,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CACrE,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CACC,IAAI,EAAE;AACZ;AAEA,MAAM,WAAW,GAAG,CAAC,CAAa,EAAE,OAAe,EAAE,OAAe,KAAI;IACtE,IAAI,OAAO,GAAgB,EAAE;IAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC3C,IAAA,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;AAExB,IAAA,IAAI,KAAK;AACT,IAAA,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE;QAC7B,QAAQ,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG;YAChC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AACvC,QAAA;QACD,QAAQ,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,GAAG;YAClC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AACvC,QAAA;AACD,QAAA,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE;AAC1B,YAAA,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;AAC5B,gBAAA,IAAI,KAAK,EAAE;AACT,oBAAA,OAAO,GAAG,OAAO,CAAC,MAAM,CACtB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAE,CAC9C;oBACD;AACD,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA;AAED,IAAA,OAAO,OAAO;AAChB,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,CAAa,EACb,OAAe,EACf,OAAe,EACf,KAAgB,EAChB,mBAA6B,KAC3B;;IACF,MAAM,OAAO,GAAgB,EAAE;IAE/B,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;AACtB,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,KAAI;AACjD,YAAA,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO;YAChC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAE;AAEtC,YAAA,IAAI,mBAAmB,EAAE;;gBAEvB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAChE,YAAA;AACD,YAAA,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS;AAAE,gBAAA,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;;AAEtD,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM;AACzB,YAAA,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,EAAA,EACT,MAAM,CAAC,IAAI,CACF,CAAC;AACjB,QAAA,CAAC,CAAC;AAEF,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,KAAI;AAClD,YAAA,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO;AAChC,YAAA,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM;YACrB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;AAC5B,YAAA,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,SAAS;AAAE,gBAAA,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;;AAEpD,YAAA,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM;AACxB,YAAA,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,EAAA,EACT,MAAM,CAAC,IAAI,CACF,CAAC;AACjB,QAAA,CAAC,CAAC;AAEF,QAAA,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;AACtB,IAAA;IAED,OAAO,mBAAmB,GAAG,OAAO,GAAG,SAAS;AAClD,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,CAAa,EACb,QAA6C,KAC3C;AACF,IAAA,MAAM,QAAQ,GAAG,IAAI,UAAU,EAAsB;IACrD,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,MAAM,GAAG,CAAC;IAEd,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,QAAQ,CAAC,OAAO,CAAC;YACf,EAAE,EAAE,CAAC,CAAC,EAAE;AACR,YAAA,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;AACjC,SAAA,CAAC;AACJ,IAAA,CAAC,CAAC;;;IAIF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,MAAM,IAAI,GAAG;AACV,aAAA,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK;AAC/B,aAAA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC;AAC3C,QAAA,MAAM,MAAM,GAAG,CAAA,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAG,CAAC,CAAC,KAAI,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE;YACT,QAAQ,CAAC,OAAO,CAAC;gBACf,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;AAChB,gBAAA,IAAI,EAAE;oBACJ,MAAM;AACP,iBAAA;AACF,aAAA,CAAC;AACH,QAAA;AAAM,aAAA;YACL,QAAQ,CAAC,cAAc,CAAC,IAAI,KAAA,IAAA,IAAJ,IAAI,KAAA,MAAA,GAAA,MAAA,GAAJ,IAAI,CAAE,EAAG,EAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAC5B,IAAI,CAAC,IAAI,CAAA,EAAA,EACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM,EAAA,CAAA,CAClC;AACH,QAAA;;QAED,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE;;QAE3E,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,EAAE;AAC1E,IAAA,CAAC,CAAC;IAEF,MAAM,OAAO,GAAW,EAAE;AAC1B,IAAA,MAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;AACjC,QAAA,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;AACzB,IAAA;AACD,IAAA,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC;IAEzB,QAAQ,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QACnC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,CAAC,CAAC,EAAE,EAAA,EACJ,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAClB,CAAC;AACjB,IAAA,CAAC,CAAC;IAEF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE;AAC9C,CAAC;AAED,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,OAAe,EAAE,KAAgB,KAAI;AAC1E,IAAA,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;QACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC1B,IAAA;AAAM,SAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;AACvB,QAAA,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC3C,IAAA;AAAM,SAAA;AACL,QAAA,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC1D,IAAA;AACH,CAAC;;;;"}

package/lib/algorithm/antv-dagre/index.d.ts

@@ -0,0 +1,15 @@
+import { BaseLayout } from '../base-layout.js';
+import { AntVDagreLayoutOptions } from './types.js';
+
+/**
+ * <zh/> AntV 实现的 Dagre 布局
+ *
+ * <en/> AntV implementation of Dagre layout
+ */
+declare class AntVDagreLayout extends BaseLayout<AntVDagreLayoutOptions> {
+    id: string;
+    protected getDefaultOptions(): AntVDagreLayoutOptions;
+    protected layout(options: AntVDagreLayoutOptions): Promise<void>;
+}
+
+export { AntVDagreLayout, AntVDagreLayoutOptions };