@seed-ship/mcp-ui-solid 5.7.0 → 6.0.0

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.cjs

@@ -0,0 +1,405 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+class DagreGraph {
+  constructor(options = {}) {
+    this.options = options;
+    this.nodes = /* @__PURE__ */ new Map();
+    this.edges = /* @__PURE__ */ new Map();
+    this.inEdges = /* @__PURE__ */ new Map();
+    this.outEdges = /* @__PURE__ */ new Map();
+    this.parentMap = /* @__PURE__ */ new Map();
+    this.childrenMap = /* @__PURE__ */ new Map();
+    if (options.tree) {
+      if (Array.isArray(options.tree) && options.tree.length > 0) {
+        if (typeof options.tree[0] === "string") {
+          options.tree.forEach((treeName) => {
+            this.parentMap.set(treeName, /* @__PURE__ */ new Map());
+            this.childrenMap.set(treeName, /* @__PURE__ */ new Map());
+          });
+        } else {
+          this.attachTreeStructure("default");
+          this.addTree(options.tree);
+        }
+      }
+    }
+    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, /* @__PURE__ */ new Set());
+      this.outEdges.set(node.id, /* @__PURE__ */ 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;
+    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);
+    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];
+    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, /* @__PURE__ */ new Map());
+      this.childrenMap.set(treeName, /* @__PURE__ */ 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) => {
+      this.addNode({ id: node.id, data: node.data });
+      if (parentId !== void 0) {
+        this.setParent(node.id, parentId, actualTreeName);
+      }
+      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);
+    const oldParent = treeParentMap.get(childId);
+    if (oldParent !== void 0) {
+      (_c = treeChildrenMap.get(oldParent)) === null || _c === void 0 ? void 0 : _c.delete(childId);
+    }
+    treeParentMap.set(childId, parentId);
+    if (!treeChildrenMap.has(parentId)) {
+      treeChildrenMap.set(parentId, /* @__PURE__ */ 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");
+    if (!this.parentMap.has(actualTreeName)) {
+      this.attachTreeStructure(actualTreeName);
+    }
+    const treeParentMap = this.parentMap.get(actualTreeName);
+    if (!treeParentMap)
+      return void 0;
+    const parentId = treeParentMap.get(nodeId);
+    if (parentId === void 0) {
+      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 !== void 0);
+  }
+  /**
+   * <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) !== void 0;
+      if (!hasParent) {
+        roots.push(node);
+      }
+    });
+    return roots;
+  }
+  dfsTree(startId, visit) {
+    const stack = [startId];
+    const visited = /* @__PURE__ */ 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);
+        for (let i = children.length - 1; i >= 0; i--) {
+          if (!visited.has(children[i].id)) {
+            stack.push(children[i].id);
+          }
+        }
+      }
+    }
+  }
+}
+exports.DagreGraph = DagreGraph;
+//# sourceMappingURL=graph.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.cjs","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.js"],"sourcesContent":["/**\n * <zh/> 内部图数据结构，用于 antv-dagre 布局算法\n *\n * <en/> Internal graph data structure for antv-dagre layout algorithm\n */\nclass DagreGraph {\n    constructor(options = {}) {\n        this.options = options;\n        this.nodes = new Map();\n        this.edges = new Map();\n        this.inEdges = new Map();\n        this.outEdges = new Map();\n        this.parentMap = new Map(); // tree structure name -> node -> parent\n        this.childrenMap = new Map(); // tree structure name -> node -> children\n        // Initialize tree structures\n        if (options.tree) {\n            if (Array.isArray(options.tree) && options.tree.length > 0) {\n                // Check if it's a tree name array or tree data array\n                if (typeof options.tree[0] === 'string') {\n                    // It's a tree name array\n                    options.tree.forEach((treeName) => {\n                        this.parentMap.set(treeName, new Map());\n                        this.childrenMap.set(treeName, new Map());\n                    });\n                }\n                else {\n                    // It's tree data, add it\n                    this.attachTreeStructure('default');\n                    this.addTree(options.tree);\n                }\n            }\n        }\n        // Add initial nodes and edges if provided\n        if (options.nodes) {\n            options.nodes.forEach((node) => this.addNode(node));\n        }\n        if (options.edges) {\n            options.edges.forEach((edge) => this.addEdge(edge));\n        }\n    }\n    /**\n     * <zh/> 添加节点\n     *\n     * <en/> Add a node\n     */\n    addNode(node) {\n        if (!this.nodes.has(node.id)) {\n            this.nodes.set(node.id, node);\n            this.inEdges.set(node.id, new Set());\n            this.outEdges.set(node.id, new Set());\n        }\n    }\n    /**\n     * <zh/> 批量添加节点\n     *\n     * <en/> Add multiple nodes\n     */\n    addNodes(nodes) {\n        nodes.forEach((node) => this.addNode(node));\n    }\n    /**\n     * <zh/> 获取节点\n     *\n     * <en/> Get a node\n     */\n    getNode(id) {\n        return this.nodes.get(id);\n    }\n    /**\n     * <zh/> 检查节点是否存在\n     *\n     * <en/> Check if a node exists\n     */\n    hasNode(id) {\n        return this.nodes.has(id);\n    }\n    /**\n     * <zh/> 删除节点\n     *\n     * <en/> Remove a node\n     */\n    removeNode(id) {\n        if (!this.nodes.has(id))\n            return;\n        // Remove all edges connected to this node\n        const inEdgeIds = Array.from(this.inEdges.get(id) || []);\n        const outEdgeIds = Array.from(this.outEdges.get(id) || []);\n        inEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));\n        outEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));\n        this.nodes.delete(id);\n        this.inEdges.delete(id);\n        this.outEdges.delete(id);\n        // Remove from tree structures\n        this.parentMap.forEach((treeParentMap) => {\n            treeParentMap.delete(id);\n        });\n        this.childrenMap.forEach((treeChildrenMap) => {\n            treeChildrenMap.delete(id);\n        });\n    }\n    /**\n     * <zh/> 获取所有节点\n     *\n     * <en/> Get all nodes\n     */\n    getAllNodes() {\n        return Array.from(this.nodes.values());\n    }\n    /**\n     * <zh/> 添加边\n     *\n     * <en/> Add an edge\n     */\n    addEdge(edge) {\n        if (!this.nodes.has(edge.source) || !this.nodes.has(edge.target)) {\n            throw new Error(`Cannot add edge ${edge.id}: source ${edge.source} or target ${edge.target} does not exist`);\n        }\n        this.edges.set(edge.id, edge);\n        this.outEdges.get(edge.source).add(edge.id);\n        this.inEdges.get(edge.target).add(edge.id);\n    }\n    /**\n     * <zh/> 批量添加边\n     *\n     * <en/> Add multiple edges\n     */\n    addEdges(edges) {\n        edges.forEach((edge) => this.addEdge(edge));\n    }\n    /**\n     * <zh/> 获取边\n     *\n     * <en/> Get an edge\n     */\n    getEdge(id) {\n        return this.edges.get(id);\n    }\n    /**\n     * <zh/> 检查边是否存在\n     *\n     * <en/> Check if an edge exists\n     */\n    hasEdge(id) {\n        return this.edges.has(id);\n    }\n    /**\n     * <zh/> 删除边\n     *\n     * <en/> Remove an edge\n     */\n    removeEdge(id) {\n        var _a, _b;\n        const edge = this.edges.get(id);\n        if (!edge)\n            return;\n        this.edges.delete(id);\n        (_a = this.outEdges.get(edge.source)) === null || _a === void 0 ? void 0 : _a.delete(id);\n        (_b = this.inEdges.get(edge.target)) === null || _b === void 0 ? void 0 : _b.delete(id);\n    }\n    /**\n     * <zh/> 获取所有边\n     *\n     * <en/> Get all edges\n     */\n    getAllEdges() {\n        return Array.from(this.edges.values());\n    }\n    /**\n     * <zh/> 更新边数据\n     *\n     * <en/> Update edge data\n     */\n    updateEdgeData(id, data) {\n        const edge = this.edges.get(id);\n        if (edge) {\n            Object.assign(edge.data, data);\n        }\n    }\n    /**\n     * <zh/> 更新节点数据\n     *\n     * <en/> Update node data\n     */\n    updateNodeData(id, data) {\n        const node = this.nodes.get(id);\n        if (node) {\n            Object.assign(node.data, data);\n        }\n    }\n    /**\n     * <zh/> 获取相关边\n     *\n     * <en/> Get related edges\n     */\n    getRelatedEdges(nodeId, direction = 'both') {\n        const result = [];\n        if (direction === 'in' || direction === 'both') {\n            const inEdgeIds = this.inEdges.get(nodeId);\n            if (inEdgeIds) {\n                inEdgeIds.forEach((edgeId) => {\n                    const edge = this.edges.get(edgeId);\n                    if (edge)\n                        result.push(edge);\n                });\n            }\n        }\n        if (direction === 'out' || direction === 'both') {\n            const outEdgeIds = this.outEdges.get(nodeId);\n            if (outEdgeIds) {\n                outEdgeIds.forEach((edgeId) => {\n                    const edge = this.edges.get(edgeId);\n                    if (edge)\n                        result.push(edge);\n                });\n            }\n        }\n        return result;\n    }\n    /**\n     * <zh/> 获取后继节点\n     *\n     * <en/> Get successor nodes\n     */\n    getSuccessors(nodeId) {\n        const outEdgeIds = this.outEdges.get(nodeId);\n        if (!outEdgeIds || outEdgeIds.size === 0)\n            return [];\n        const successors = [];\n        outEdgeIds.forEach((edgeId) => {\n            const edge = this.edges.get(edgeId);\n            if (edge) {\n                const targetNode = this.nodes.get(edge.target);\n                if (targetNode)\n                    successors.push(targetNode);\n            }\n        });\n        return successors.length > 0 ? successors : [];\n    }\n    /**\n     * <zh/> 获取前驱节点\n     *\n     * <en/> Get predecessor nodes\n     */\n    getPredecessors(nodeId) {\n        const inEdgeIds = this.inEdges.get(nodeId);\n        if (!inEdgeIds || inEdgeIds.size === 0)\n            return [];\n        const predecessors = [];\n        inEdgeIds.forEach((edgeId) => {\n            const edge = this.edges.get(edgeId);\n            if (edge) {\n                const sourceNode = this.nodes.get(edge.source);\n                if (sourceNode)\n                    predecessors.push(sourceNode);\n            }\n        });\n        return predecessors.length > 0 ? predecessors : [];\n    }\n    /**\n     * <zh/> 获取邻居节点\n     *\n     * <en/> Get neighbor nodes\n     */\n    getNeighbors(nodeId) {\n        const successors = this.getSuccessors(nodeId) || [];\n        const predecessors = this.getPredecessors(nodeId) || [];\n        const neighbors = [...successors, ...predecessors];\n        // Remove duplicates\n        const uniqueNeighbors = Array.from(new Map(neighbors.map((n) => [n.id, n])).values());\n        return uniqueNeighbors.length > 0 ? uniqueNeighbors : [];\n    }\n    /**\n     * <zh/> 附加树结构\n     *\n     * <en/> Attach tree structure\n     */\n    attachTreeStructure(treeName) {\n        if (!this.parentMap.has(treeName)) {\n            this.parentMap.set(treeName, new Map());\n            this.childrenMap.set(treeName, new Map());\n        }\n    }\n    /**\n     * <zh/> 添加树结构（递归添加节点及其子节点）\n     *\n     * <en/> Add tree structure (recursively add nodes and their children)\n     */\n    addTree(tree, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        if (!this.hasTreeStructure(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const trees = Array.isArray(tree) ? tree : [tree];\n        const addTreeNode = (node, parentId) => {\n            // Add the node itself\n            this.addNode({ id: node.id, data: node.data });\n            // Set parent relationship if parent exists\n            if (parentId !== undefined) {\n                this.setParent(node.id, parentId, actualTreeName);\n            }\n            // Recursively add children\n            if (node.children && node.children.length > 0) {\n                node.children.forEach((child) => {\n                    addTreeNode(child, node.id);\n                });\n            }\n        };\n        trees.forEach((t) => addTreeNode(t));\n    }\n    /**\n     * <zh/> 检查是否有树结构\n     *\n     * <en/> Check if has tree structure\n     */\n    hasTreeStructure(treeName) {\n        return this.parentMap.has(treeName);\n    }\n    /**\n     * <zh/> 设置父节点\n     *\n     * <en/> Set parent node\n     */\n    setParent(childId, parentId, treeName) {\n        var _a, _b, _c;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        if (!this.parentMap.has(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        const treeChildrenMap = this.childrenMap.get(actualTreeName);\n        // Remove from old parent\n        const oldParent = treeParentMap.get(childId);\n        if (oldParent !== undefined) {\n            (_c = treeChildrenMap.get(oldParent)) === null || _c === void 0 ? void 0 : _c.delete(childId);\n        }\n        // Set new parent\n        treeParentMap.set(childId, parentId);\n        // Add to new parent's children\n        if (!treeChildrenMap.has(parentId)) {\n            treeChildrenMap.set(parentId, new Set());\n        }\n        treeChildrenMap.get(parentId).add(childId);\n    }\n    /**\n     * <zh/> 获取父节点\n     *\n     * <en/> Get parent node\n     */\n    getParent(nodeId, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        // Ensure tree structure exists\n        if (!this.parentMap.has(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        if (!treeParentMap)\n            return undefined;\n        const parentId = treeParentMap.get(nodeId);\n        if (parentId === undefined) {\n            // Node has no parent set\n            return null;\n        }\n        return this.nodes.get(parentId);\n    }\n    /**\n     * <zh/> 获取子节点\n     *\n     * <en/> Get children nodes\n     */\n    getChildren(nodeId, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        const treeChildrenMap = this.childrenMap.get(actualTreeName);\n        if (!treeChildrenMap)\n            return [];\n        const childIds = treeChildrenMap.get(nodeId);\n        if (!childIds)\n            return [];\n        return Array.from(childIds)\n            .map((id) => this.nodes.get(id))\n            .filter((node) => node !== undefined);\n    }\n    /**\n     * <zh/> 获取根节点（没有父节点的节点）\n     *\n     * <en/> Get root nodes (nodes without parents)\n     */\n    getRoots(treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        const roots = [];\n        this.nodes.forEach((node) => {\n            const hasParent = treeParentMap && treeParentMap.get(node.id) !== undefined;\n            if (!hasParent) {\n                roots.push(node);\n            }\n        });\n        return roots;\n    }\n    dfsTree(startId, visit) {\n        const stack = [startId];\n        const visited = new Set();\n        while (stack.length > 0) {\n            const nodeId = stack.pop();\n            if (visited.has(nodeId))\n                continue;\n            const node = this.getNode(nodeId);\n            if (node) {\n                visited.add(nodeId);\n                const shouldSkipChildren = visit(node);\n                if (shouldSkipChildren === true)\n                    continue;\n                const children = this.getChildren(nodeId);\n                // Push children in reverse order so they are processed in the correct order\n                for (let i = children.length - 1; i >= 0; i--) {\n                    if (!visited.has(children[i].id)) {\n                        stack.push(children[i].id);\n                    }\n                }\n            }\n        }\n    }\n}\n\nexport { DagreGraph };\n//# sourceMappingURL=graph.js.map\n"],"names":[],"mappings":";;AAKA,MAAM,WAAW;AAAA,EACb,YAAY,UAAU,IAAI;AACtB,SAAK,UAAU;AACf,SAAK,QAAQ,oBAAI,IAAG;AACpB,SAAK,QAAQ,oBAAI,IAAG;AACpB,SAAK,UAAU,oBAAI,IAAG;AACtB,SAAK,WAAW,oBAAI,IAAG;AACvB,SAAK,YAAY,oBAAI;AACrB,SAAK,cAAc,oBAAI;AAEvB,QAAI,QAAQ,MAAM;AACd,UAAI,MAAM,QAAQ,QAAQ,IAAI,KAAK,QAAQ,KAAK,SAAS,GAAG;AAExD,YAAI,OAAO,QAAQ,KAAK,CAAC,MAAM,UAAU;AAErC,kBAAQ,KAAK,QAAQ,CAAC,aAAa;AAC/B,iBAAK,UAAU,IAAI,UAAU,oBAAI,IAAG,CAAE;AACtC,iBAAK,YAAY,IAAI,UAAU,oBAAI,IAAG,CAAE;AAAA,UAC5C,CAAC;AAAA,QACL,OACK;AAED,eAAK,oBAAoB,SAAS;AAClC,eAAK,QAAQ,QAAQ,IAAI;AAAA,QAC7B;AAAA,MACJ;AAAA,IACJ;AAEA,QAAI,QAAQ,OAAO;AACf,cAAQ,MAAM,QAAQ,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,IACtD;AACA,QAAI,QAAQ,OAAO;AACf,cAAQ,MAAM,QAAQ,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,IACtD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM;AACV,QAAI,CAAC,KAAK,MAAM,IAAI,KAAK,EAAE,GAAG;AAC1B,WAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAC5B,WAAK,QAAQ,IAAI,KAAK,IAAI,oBAAI,KAAK;AACnC,WAAK,SAAS,IAAI,KAAK,IAAI,oBAAI,KAAK;AAAA,IACxC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,OAAO;AACZ,UAAM,QAAQ,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,IAAI;AACR,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,IAAI;AACR,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,IAAI;AACX,QAAI,CAAC,KAAK,MAAM,IAAI,EAAE;AAClB;AAEJ,UAAM,YAAY,MAAM,KAAK,KAAK,QAAQ,IAAI,EAAE,KAAK,EAAE;AACvD,UAAM,aAAa,MAAM,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE;AACzD,cAAU,QAAQ,CAAC,WAAW,KAAK,WAAW,MAAM,CAAC;AACrD,eAAW,QAAQ,CAAC,WAAW,KAAK,WAAW,MAAM,CAAC;AACtD,SAAK,MAAM,OAAO,EAAE;AACpB,SAAK,QAAQ,OAAO,EAAE;AACtB,SAAK,SAAS,OAAO,EAAE;AAEvB,SAAK,UAAU,QAAQ,CAAC,kBAAkB;AACtC,oBAAc,OAAO,EAAE;AAAA,IAC3B,CAAC;AACD,SAAK,YAAY,QAAQ,CAAC,oBAAoB;AAC1C,sBAAgB,OAAO,EAAE;AAAA,IAC7B,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,MAAM,OAAM,CAAE;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM;AACV,QAAI,CAAC,KAAK,MAAM,IAAI,KAAK,MAAM,KAAK,CAAC,KAAK,MAAM,IAAI,KAAK,MAAM,GAAG;AAC9D,YAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE,YAAY,KAAK,MAAM,cAAc,KAAK,MAAM,iBAAiB;AAAA,IAC/G;AACA,SAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAC5B,SAAK,SAAS,IAAI,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE;AAC1C,SAAK,QAAQ,IAAI,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,OAAO;AACZ,UAAM,QAAQ,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,IAAI;AACR,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,IAAI;AACR,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,IAAI;AACX,QAAI,IAAI;AACR,UAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,QAAI,CAAC;AACD;AACJ,SAAK,MAAM,OAAO,EAAE;AACpB,KAAC,KAAK,KAAK,SAAS,IAAI,KAAK,MAAM,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,OAAO,EAAE;AACvF,KAAC,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,OAAO,EAAE;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,MAAM,OAAM,CAAE;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,IAAI,MAAM;AACrB,UAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,QAAI,MAAM;AACN,aAAO,OAAO,KAAK,MAAM,IAAI;AAAA,IACjC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,IAAI,MAAM;AACrB,UAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,QAAI,MAAM;AACN,aAAO,OAAO,KAAK,MAAM,IAAI;AAAA,IACjC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB,QAAQ,YAAY,QAAQ;AACxC,UAAM,SAAS,CAAA;AACf,QAAI,cAAc,QAAQ,cAAc,QAAQ;AAC5C,YAAM,YAAY,KAAK,QAAQ,IAAI,MAAM;AACzC,UAAI,WAAW;AACX,kBAAU,QAAQ,CAAC,WAAW;AAC1B,gBAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAClC,cAAI;AACA,mBAAO,KAAK,IAAI;AAAA,QACxB,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAI,cAAc,SAAS,cAAc,QAAQ;AAC7C,YAAM,aAAa,KAAK,SAAS,IAAI,MAAM;AAC3C,UAAI,YAAY;AACZ,mBAAW,QAAQ,CAAC,WAAW;AAC3B,gBAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAClC,cAAI;AACA,mBAAO,KAAK,IAAI;AAAA,QACxB,CAAC;AAAA,MACL;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,QAAQ;AAClB,UAAM,aAAa,KAAK,SAAS,IAAI,MAAM;AAC3C,QAAI,CAAC,cAAc,WAAW,SAAS;AACnC,aAAO,CAAA;AACX,UAAM,aAAa,CAAA;AACnB,eAAW,QAAQ,CAAC,WAAW;AAC3B,YAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAClC,UAAI,MAAM;AACN,cAAM,aAAa,KAAK,MAAM,IAAI,KAAK,MAAM;AAC7C,YAAI;AACA,qBAAW,KAAK,UAAU;AAAA,MAClC;AAAA,IACJ,CAAC;AACD,WAAO,WAAW,SAAS,IAAI,aAAa,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB,QAAQ;AACpB,UAAM,YAAY,KAAK,QAAQ,IAAI,MAAM;AACzC,QAAI,CAAC,aAAa,UAAU,SAAS;AACjC,aAAO,CAAA;AACX,UAAM,eAAe,CAAA;AACrB,cAAU,QAAQ,CAAC,WAAW;AAC1B,YAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAClC,UAAI,MAAM;AACN,cAAM,aAAa,KAAK,MAAM,IAAI,KAAK,MAAM;AAC7C,YAAI;AACA,uBAAa,KAAK,UAAU;AAAA,MACpC;AAAA,IACJ,CAAC;AACD,WAAO,aAAa,SAAS,IAAI,eAAe,CAAA;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,QAAQ;AACjB,UAAM,aAAa,KAAK,cAAc,MAAM,KAAK,CAAA;AACjD,UAAM,eAAe,KAAK,gBAAgB,MAAM,KAAK,CAAA;AACrD,UAAM,YAAY,CAAC,GAAG,YAAY,GAAG,YAAY;AAEjD,UAAM,kBAAkB,MAAM,KAAK,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ;AACpF,WAAO,gBAAgB,SAAS,IAAI,kBAAkB,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAoB,UAAU;AAC1B,QAAI,CAAC,KAAK,UAAU,IAAI,QAAQ,GAAG;AAC/B,WAAK,UAAU,IAAI,UAAU,oBAAI,IAAG,CAAE;AACtC,WAAK,YAAY,IAAI,UAAU,oBAAI,IAAG,CAAE;AAAA,IAC5C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM,UAAU;AACpB,QAAI,IAAI;AACR,UAAM,iBAAiB,cAAc,MAAM,KAAK,KAAK,QAAQ,UAAU,QAAQ,OAAO,SAAS,SAAS,GAAG,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK;AAChJ,QAAI,CAAC,KAAK,iBAAiB,cAAc,GAAG;AACxC,WAAK,oBAAoB,cAAc;AAAA,IAC3C;AACA,UAAM,QAAQ,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAChD,UAAM,cAAc,CAAC,MAAM,aAAa;AAEpC,WAAK,QAAQ,EAAE,IAAI,KAAK,IAAI,MAAM,KAAK,MAAM;AAE7C,UAAI,aAAa,QAAW;AACxB,aAAK,UAAU,KAAK,IAAI,UAAU,cAAc;AAAA,MACpD;AAEA,UAAI,KAAK,YAAY,KAAK,SAAS,SAAS,GAAG;AAC3C,aAAK,SAAS,QAAQ,CAAC,UAAU;AAC7B,sBAAY,OAAO,KAAK,EAAE;AAAA,QAC9B,CAAC;AAAA,MACL;AAAA,IACJ;AACA,UAAM,QAAQ,CAAC,MAAM,YAAY,CAAC,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,UAAU;AACvB,WAAO,KAAK,UAAU,IAAI,QAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,SAAS,UAAU,UAAU;AACnC,QAAI,IAAI,IAAI;AACZ,UAAM,iBAAiB,cAAc,MAAM,KAAK,KAAK,QAAQ,UAAU,QAAQ,OAAO,SAAS,SAAS,GAAG,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK;AAChJ,QAAI,CAAC,KAAK,UAAU,IAAI,cAAc,GAAG;AACrC,WAAK,oBAAoB,cAAc;AAAA,IAC3C;AACA,UAAM,gBAAgB,KAAK,UAAU,IAAI,cAAc;AACvD,UAAM,kBAAkB,KAAK,YAAY,IAAI,cAAc;AAE3D,UAAM,YAAY,cAAc,IAAI,OAAO;AAC3C,QAAI,cAAc,QAAW;AACzB,OAAC,KAAK,gBAAgB,IAAI,SAAS,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,OAAO,OAAO;AAAA,IAChG;AAEA,kBAAc,IAAI,SAAS,QAAQ;AAEnC,QAAI,CAAC,gBAAgB,IAAI,QAAQ,GAAG;AAChC,sBAAgB,IAAI,UAAU,oBAAI,IAAG,CAAE;AAAA,IAC3C;AACA,oBAAgB,IAAI,QAAQ,EAAE,IAAI,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,QAAQ,UAAU;AACxB,QAAI,IAAI;AACR,UAAM,iBAAiB,cAAc,MAAM,KAAK,KAAK,QAAQ,UAAU,QAAQ,OAAO,SAAS,SAAS,GAAG,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK;AAEhJ,QAAI,CAAC,KAAK,UAAU,IAAI,cAAc,GAAG;AACrC,WAAK,oBAAoB,cAAc;AAAA,IAC3C;AACA,UAAM,gBAAgB,KAAK,UAAU,IAAI,cAAc;AACvD,QAAI,CAAC;AACD,aAAO;AACX,UAAM,WAAW,cAAc,IAAI,MAAM;AACzC,QAAI,aAAa,QAAW;AAExB,aAAO;AAAA,IACX;AACA,WAAO,KAAK,MAAM,IAAI,QAAQ;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,QAAQ,UAAU;AAC1B,QAAI,IAAI;AACR,UAAM,iBAAiB,cAAc,MAAM,KAAK,KAAK,QAAQ,UAAU,QAAQ,OAAO,SAAS,SAAS,GAAG,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK;AAChJ,UAAM,kBAAkB,KAAK,YAAY,IAAI,cAAc;AAC3D,QAAI,CAAC;AACD,aAAO,CAAA;AACX,UAAM,WAAW,gBAAgB,IAAI,MAAM;AAC3C,QAAI,CAAC;AACD,aAAO,CAAA;AACX,WAAO,MAAM,KAAK,QAAQ,EACrB,IAAI,CAAC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,EAC9B,OAAO,CAAC,SAAS,SAAS,MAAS;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,UAAU;AACf,QAAI,IAAI;AACR,UAAM,iBAAiB,cAAc,MAAM,KAAK,KAAK,QAAQ,UAAU,QAAQ,OAAO,SAAS,SAAS,GAAG,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK;AAChJ,UAAM,gBAAgB,KAAK,UAAU,IAAI,cAAc;AACvD,UAAM,QAAQ,CAAA;AACd,SAAK,MAAM,QAAQ,CAAC,SAAS;AACzB,YAAM,YAAY,iBAAiB,cAAc,IAAI,KAAK,EAAE,MAAM;AAClE,UAAI,CAAC,WAAW;AACZ,cAAM,KAAK,IAAI;AAAA,MACnB;AAAA,IACJ,CAAC;AACD,WAAO;AAAA,EACX;AAAA,EACA,QAAQ,SAAS,OAAO;AACpB,UAAM,QAAQ,CAAC,OAAO;AACtB,UAAM,UAAU,oBAAI,IAAG;AACvB,WAAO,MAAM,SAAS,GAAG;AACrB,YAAM,SAAS,MAAM,IAAG;AACxB,UAAI,QAAQ,IAAI,MAAM;AAClB;AACJ,YAAM,OAAO,KAAK,QAAQ,MAAM;AAChC,UAAI,MAAM;AACN,gBAAQ,IAAI,MAAM;AAClB,cAAM,qBAAqB,MAAM,IAAI;AACrC,YAAI,uBAAuB;AACvB;AACJ,cAAM,WAAW,KAAK,YAAY,MAAM;AAExC,iBAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,cAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,EAAE,EAAE,GAAG;AAC9B,kBAAM,KAAK,SAAS,CAAC,EAAE,EAAE;AAAA,UAC7B;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACJ;;","x_google_ignoreList":[0]}