vue-hook-optimizer 0.0.70 → 0.0.72-beta.1

package/dist/index.d.mts

@@ -1,6 +1,6 @@
 import { SFCStyleBlock } from '@vue/compiler-sfc';
 export { parse } from '@vue/compiler-sfc';
-import { Node, Edge } from 'vis-network';
+import { Edge, Node } from 'vis-network';
 
 interface TypedNode {
     label: string;
@@ -20,14 +20,20 @@ declare enum NodeType {
 declare function analyze$4(content: string, lineOffset?: number, jsx?: boolean): {
     graph: {
         nodes: Set<TypedNode>;
-        edges: Map<TypedNode, Set<TypedNode>>;
+        edges: Map<TypedNode, Set<{
+            node: TypedNode;
+            type: "get" | "set";
+        }>>;
     };
     nodesUsedInTemplate: Set<string>;
 };
 
 declare function analyze$3(content: string, lineOffset?: number, jsx?: boolean): {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: "get" | "set";
+    }>>;
 };
 
 declare function analyze$2(styles: SFCStyleBlock[]): Set<string>;
@@ -37,7 +43,10 @@ declare function analyze$1(content: string): Set<string>;
 declare function analyze(content: string, type?: "vue" | "react", lineOffset?: number, addInfo?: boolean): {
     graph: {
         nodes: Set<TypedNode>;
-        edges: Map<TypedNode, Set<TypedNode>>;
+        edges: Map<TypedNode, Set<{
+            node: TypedNode;
+            type: "get" | "set";
+        }>>;
     };
     nodesUsedInTemplate: Set<string>;
 };
@@ -62,7 +71,10 @@ interface Suggestion {
 }
 declare function gen(graph: {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: 'get' | 'set';
+    }>>;
 }, nodesUsedInTemplate: Set<string>, nodesUsedInStyle?: Set<string>): Suggestion[];
 
 type CustomNode = Node & {
@@ -70,7 +82,10 @@ type CustomNode = Node & {
 };
 declare function getVisData(graph: {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: 'get' | 'set';
+    }>>;
 }, nodesUsedInTemplate: Set<string>, nodesUsedInStyle?: Set<string>): {
     nodes: CustomNode[];
     edges: Edge[];

package/dist/index.d.ts

@@ -1,6 +1,6 @@
 import { SFCStyleBlock } from '@vue/compiler-sfc';
 export { parse } from '@vue/compiler-sfc';
-import { Node, Edge } from 'vis-network';
+import { Edge, Node } from 'vis-network';
 
 interface TypedNode {
     label: string;
@@ -20,14 +20,20 @@ declare enum NodeType {
 declare function analyze$4(content: string, lineOffset?: number, jsx?: boolean): {
     graph: {
         nodes: Set<TypedNode>;
-        edges: Map<TypedNode, Set<TypedNode>>;
+        edges: Map<TypedNode, Set<{
+            node: TypedNode;
+            type: "get" | "set";
+        }>>;
     };
     nodesUsedInTemplate: Set<string>;
 };
 
 declare function analyze$3(content: string, lineOffset?: number, jsx?: boolean): {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: "get" | "set";
+    }>>;
 };
 
 declare function analyze$2(styles: SFCStyleBlock[]): Set<string>;
@@ -37,7 +43,10 @@ declare function analyze$1(content: string): Set<string>;
 declare function analyze(content: string, type?: "vue" | "react", lineOffset?: number, addInfo?: boolean): {
     graph: {
         nodes: Set<TypedNode>;
-        edges: Map<TypedNode, Set<TypedNode>>;
+        edges: Map<TypedNode, Set<{
+            node: TypedNode;
+            type: "get" | "set";
+        }>>;
     };
     nodesUsedInTemplate: Set<string>;
 };
@@ -62,7 +71,10 @@ interface Suggestion {
 }
 declare function gen(graph: {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: 'get' | 'set';
+    }>>;
 }, nodesUsedInTemplate: Set<string>, nodesUsedInStyle?: Set<string>): Suggestion[];
 
 type CustomNode = Node & {
@@ -70,7 +82,10 @@ type CustomNode = Node & {
 };
 declare function getVisData(graph: {
     nodes: Set<TypedNode>;
-    edges: Map<TypedNode, Set<TypedNode>>;
+    edges: Map<TypedNode, Set<{
+        node: TypedNode;
+        type: 'get' | 'set';
+    }>>;
 }, nodesUsedInTemplate: Set<string>, nodesUsedInStyle?: Set<string>): {
     nodes: CustomNode[];
     edges: Edge[];

package/dist/index.js

@@ -28,8 +28,8 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
 var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
 
 // src/index.ts
-var index_exports = {};
-__export(index_exports, {
+var src_exports = {};
+__export(src_exports, {
   NodeType: () => NodeType,
   SuggestionType: () => SuggestionType,
   analyzeOptions: () => analyze2,
@@ -42,7 +42,7 @@ __export(index_exports, {
   getVisData: () => getVisData,
   parse: () => import_compiler_sfc5.parse
 });
-module.exports = __toCommonJS(index_exports);
+module.exports = __toCommonJS(src_exports);
 
 // src/analyze/options.ts
 var import_traverse2 = __toESM(require("@babel/traverse"));
@@ -123,9 +123,19 @@ var NodeCollection = class {
       return this.nodes.get(node);
     }).filter((node) => !!node));
     const edges = new Map(Array.from(graph.edges).map(([from, to]) => {
-      return [this.nodes.get(from), new Set(Array.from(to).map((node) => {
-        return this.nodes.get(node);
-      }).filter((node) => !!node))];
+      const labelMap = /* @__PURE__ */ new Map();
+      for (const item of to) {
+        const node = this.nodes.get(item.label);
+        if (!node) {
+          continue;
+        }
+        const existing = labelMap.get(item.label);
+        if (!existing || existing.type === "get" && item.type === "set") {
+          labelMap.set(item.label, { node, type: item.type });
+        }
+      }
+      const items = Array.from(labelMap.values());
+      return [this.nodes.get(from), new Set(items)];
     }));
     return {
       nodes,
@@ -158,6 +168,23 @@ function getComment(node) {
   });
   return comment.trim();
 }
+function isWritingNode(path) {
+  const assignParent = path.findParent((p) => p.isAssignmentExpression());
+  if (assignParent) {
+    const leftNode = assignParent.node.left;
+    if (leftNode.start != null && path.node.start >= leftNode.start && path.node.end <= leftNode.end) {
+      return true;
+    }
+  }
+  const updateParent = path.findParent((p) => p.isUpdateExpression());
+  if (updateParent) {
+    const argNode = updateParent.node.argument;
+    if (argNode.start != null && path.node.start >= argNode.start && path.node.end <= argNode.end) {
+      return true;
+    }
+  }
+  return false;
+}
 
 // src/analyze/setupScript.ts
 var traverse = import_traverse.default.default?.default || import_traverse.default.default || import_traverse.default;
@@ -409,7 +436,10 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
                   const watchArgsNames = Array.from(watchArgs).map((arg) => arg.name);
                   watchArgs.forEach((watchArg) => {
                     if (!watchArgsNames.includes(path1.node.name)) {
-                      graph.edges.get(watchArg.name)?.add(path1.node.name);
+                      graph.edges.get(watchArg.name)?.add({
+                        label: path1.node.name,
+                        type: isWritingNode(path1) ? "set" : "get"
+                      });
                     }
                   });
                 }
@@ -437,14 +467,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
           Identifier(path1) {
             const binding = path1.scope.getBinding(path1.node.name);
             if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-              graph.edges.get(name)?.add(path1.node.name);
+              graph.edges.get(name)?.add({
+                label: path1.node.name,
+                type: isWritingNode(path1) ? "set" : "get"
+              });
             }
           },
           MemberExpression(path1) {
             if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
               const binding = path1.scope.getBinding(path1.node.object.name);
               if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                graph.edges.get(name)?.add(path1.node.property.name);
+                graph.edges.get(name)?.add({
+                  label: path1.node.property.name,
+                  type: isWritingNode(path1) ? "set" : "get"
+                });
               }
             }
           }
@@ -462,14 +498,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
                   Identifier(path1) {
                     const binding = path1.scope.getBinding(path1.node.name);
                     if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                      graph.edges.get(name)?.add(path1.node.name);
+                      graph.edges.get(name)?.add({
+                        label: path1.node.name,
+                        type: isWritingNode(path1) ? "set" : "get"
+                      });
                     }
                   },
                   MemberExpression(path1) {
                     if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
                       const binding = path1.scope.getBinding(path1.node.object.name);
                       if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                        graph.edges.get(name)?.add(path1.node.property.name);
+                        graph.edges.get(name)?.add({
+                          label: path1.node.property.name,
+                          type: isWritingNode(path1) ? "set" : "get"
+                        });
                       }
                     }
                   }
@@ -486,14 +528,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
                   Identifier(path1) {
                     const binding = path1.scope.getBinding(path1.node.name);
                     if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                      graph.edges.get(name)?.add(path1.node.name);
+                      graph.edges.get(name)?.add({
+                        label: path1.node.name,
+                        type: isWritingNode(path1) ? "set" : "get"
+                      });
                     }
                   },
                   MemberExpression(path1) {
                     if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
                       const binding = path1.scope.getBinding(path1.node.object.name);
                       if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                        graph.edges.get(name)?.add(path1.node.property.name);
+                        graph.edges.get(name)?.add({
+                          label: path1.node.property.name,
+                          type: isWritingNode(path1) ? "set" : "get"
+                        });
                       }
                     }
                   }
@@ -515,14 +563,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
               Identifier(path1) {
                 const binding = path1.scope.getBinding(path1.node.name);
                 if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                  graph.edges.get(name)?.add(path1.node.name);
+                  graph.edges.get(name)?.add({
+                    label: path1.node.name,
+                    type: isWritingNode(path1) ? "set" : "get"
+                  });
                 }
               },
               MemberExpression(path1) {
                 if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
                   const binding = path1.scope.getBinding(path1.node.object.name);
                   if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                    graph.edges.get(name)?.add(path1.node.property.name);
+                    graph.edges.get(name)?.add({
+                      label: path1.node.property.name,
+                      type: isWritingNode(path1) ? "set" : "get"
+                    });
                   }
                 }
               }
@@ -533,14 +587,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
           if (path.node.init.type === "Identifier") {
             const binding = path.scope.getBinding(path.node.init.name);
             if (graph.nodes.has(path.node.init.name) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-              graph.edges.get(name)?.add(path.node.init.name);
+              graph.edges.get(name)?.add({
+                label: path.node.init.name,
+                type: isWritingNode(path) ? "set" : "get"
+              });
             }
           } else {
             traverse(path.node.init, {
               Identifier(path1) {
                 const binding = path1.scope.getBinding(path1.node.name);
                 if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                  graph.edges.get(name)?.add(path1.node.name);
+                  graph.edges.get(name)?.add({
+                    label: path1.node.name,
+                    type: isWritingNode(path1) ? "set" : "get"
+                  });
                 }
               }
             }, path.scope, path);
@@ -555,14 +615,20 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
           Identifier(path1) {
             const binding = path1.scope.getBinding(path1.node.name);
             if (graph.nodes.has(path1.node.name) && (path1.parent.type !== "MemberExpression" && path1.parent.type !== "OptionalMemberExpression" || path1.parent.object === path1.node) && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-              graph.edges.get(name)?.add(path1.node.name);
+              graph.edges.get(name)?.add({
+                label: path1.node.name,
+                type: isWritingNode(path1) ? "set" : "get"
+              });
             }
           },
           MemberExpression(path1) {
             if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
               const binding = path1.scope.getBinding(path1.node.object.name);
               if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                graph.edges.get(name)?.add(path1.node.property.name);
+                graph.edges.get(name)?.add({
+                  label: path1.node.property.name,
+                  type: isWritingNode(path1) ? "set" : "get"
+                });
               }
             }
           }
@@ -577,7 +643,10 @@ function processSetup(ast, parentScope, parentPath, _spread, _lineOffset = 0) {
             if (path1.node.object.type === "Identifier" && spread.includes(path1.node.object.name)) {
               const binding = path1.scope.getBinding(path1.node.object.name);
               if (spread.includes(path1.node.object.name) && path1.node.property.type === "Identifier" && (binding?.scope.block.type === "Program" || parentScope === binding?.scope)) {
-                graph.edges.get(name)?.add(path1.node.property.name);
+                graph.edges.get(name)?.add({
+                  label: path1.node.property.name,
+                  type: isWritingNode(path1) ? "set" : "get"
+                });
               }
             }
           }
@@ -818,7 +887,10 @@ function analyze2(content, lineOffset = 0, jsx = false) {
                             nodeCollection.addNode(name, path3.node.key, {
                               comment: getComment(path3.node)
                             });
-                            graph.edges.set(name, /* @__PURE__ */ new Set([valName]));
+                            graph.edges.set(name, /* @__PURE__ */ new Set([{
+                              label: valName,
+                              type: isWritingNode(path3) ? "set" : "get"
+                            }]));
                           }
                         }
                       }
@@ -938,7 +1010,10 @@ function analyze2(content, lineOffset = 0, jsx = false) {
                   traverse2(prop, {
                     MemberExpression(path2) {
                       if (path2.node.object.type === "ThisExpression" && path2.node.property.type === "Identifier") {
-                        graph.edges.get(name)?.add(path2.node.property.name);
+                        graph.edges.get(name)?.add({
+                          label: path2.node.property.name,
+                          type: isWritingNode(path2) ? "set" : "get"
+                        });
                       }
                     }
                   }, path1.scope, path1);
@@ -950,7 +1025,10 @@ function analyze2(content, lineOffset = 0, jsx = false) {
                       traverse2(prop1, {
                         MemberExpression(path2) {
                           if (path2.node.object.type === "ThisExpression" && path2.node.property.type === "Identifier") {
-                            graph.edges.get(name)?.add(path2.node.property.name);
+                            graph.edges.get(name)?.add({
+                              label: path2.node.property.name,
+                              type: isWritingNode(path2) ? "set" : "get"
+                            });
                           }
                         }
                       }, path1.scope, path1);
@@ -969,7 +1047,10 @@ function analyze2(content, lineOffset = 0, jsx = false) {
                   traverse2(prop, {
                     MemberExpression(path2) {
                       if (path2.node.object.type === "ThisExpression" && path2.node.property.type === "Identifier") {
-                        graph.edges.get(name)?.add(path2.node.property.name);
+                        graph.edges.get(name)?.add({
+                          label: path2.node.property.name,
+                          type: isWritingNode(path2) ? "set" : "get"
+                        });
                       }
                     }
                   }, path1.scope, path1);
@@ -997,7 +1078,10 @@ function analyze2(content, lineOffset = 0, jsx = false) {
                     MemberExpression(path2) {
                       if (path2.node.object.type === "ThisExpression" && path2.node.property.type === "Identifier") {
                         if (watchArg && watchArg.name !== path2.node.property.name) {
-                          graph.edges.get(watchArg.name)?.add(path2.node.property.name);
+                          graph.edges.get(watchArg.name)?.add({
+                            label: path2.node.property.name,
+                            type: isWritingNode(path2) ? "set" : "get"
+                          });
                         }
                       }
                     }
@@ -1555,7 +1639,10 @@ function addIdentifiesToGraphByScanReturn({ path: path1, graph, nodeCollection,
                   nodeCollection.addNode(name, path3.node.key, {
                     comment: getComment(path3.node)
                   });
-                  graph.edges.set(name, /* @__PURE__ */ new Set([valName]));
+                  graph.edges.set(name, /* @__PURE__ */ new Set([{
+                    label: valName,
+                    type: isWritingNode(path3) ? "set" : "get"
+                  }]));
                 }
               }
             }
@@ -1714,7 +1801,10 @@ function processByReturnJSX(params) {
   function addEdge({ fromName, toName, path, scope, toScope, collectionNodes }) {
     const bindingScope = toScope || path.scope.getBinding(toName)?.scope;
     if (scope === bindingScope && collectionNodes.has(toName)) {
-      graph.edges.get(fromName)?.add(toName);
+      graph.edges.get(fromName)?.add({
+        label: toName,
+        type: isWritingNode(path) ? "set" : "get"
+      });
     }
   }
   function addUsed({ name, path, parentPath: parentPath2 }) {
@@ -1833,7 +1923,10 @@ function processByReact(params) {
   function addEdge({ fromName, toName, path, scope, toScope, collectionNodes }) {
     const bindingScope = toScope || path.scope.getBinding(toName)?.scope;
     if (scope === bindingScope && collectionNodes.has(toName)) {
-      graph.edges.get(fromName)?.add(toName);
+      graph.edges.get(fromName)?.add({
+        label: toName,
+        type: isWritingNode(path) ? "set" : "get"
+      });
     }
   }
   function addUsed({ name, path, parentPath: parentPath2 }) {
@@ -2040,7 +2133,7 @@ function noIndegreeFilter(graph) {
   });
   graph.forEach((targets, node) => {
     targets.forEach((target) => {
-      indegree.set(target, (indegree.get(target) || 0) + 1);
+      indegree.set(target.node, (indegree.get(target.node) || 0) + 1);
     });
   });
   return nodes.filter((node) => indegree.get(node) === 0);
@@ -2054,8 +2147,8 @@ function findLinearPaths(graph) {
       nodeInDegrees.set(node, 0);
     }
     for (const edge of edges) {
-      const inDegree = nodeInDegrees.get(edge) || 0;
-      nodeInDegrees.set(edge, inDegree + 1);
+      const inDegree = nodeInDegrees.get(edge.node) || 0;
+      nodeInDegrees.set(edge.node, inDegree + 1);
     }
   }
   function dfs2(node, path) {
@@ -2070,7 +2163,7 @@ function findLinearPaths(graph) {
         addOrUpdatePath([...path]);
       }
     } else {
-      const nextNode = Array.from(edges)[0];
+      const nextNode = Array.from(edges)[0].node;
       const nextNodeInDegree = nodeInDegrees.get(nextNode) || 0;
       if (nextNodeInDegree === 1) {
         dfs2(nextNode, path);
@@ -2132,19 +2225,19 @@ function findArticulationPoints(graph) {
     time++;
     visited.add(node);
     for (const neighbor of graph2.get(node) || []) {
-      if (!visited.has(neighbor)) {
+      if (!visited.has(neighbor.node)) {
         children++;
-        parent.set(neighbor, node);
-        APUtil(graph2, neighbor);
-        low.set(node, Math.min(low.get(node), low.get(neighbor)));
+        parent.set(neighbor.node, node);
+        APUtil(graph2, neighbor.node);
+        low.set(node, Math.min(low.get(node), low.get(neighbor.node)));
         if (parent.get(node) === null && children > 1) {
           ap.add(node);
         }
-        if (parent.get(node) !== null && low.get(neighbor) >= disc.get(node)) {
+        if (parent.get(node) !== null && low.get(neighbor.node) >= disc.get(node)) {
           ap.add(node);
         }
-      } else if (neighbor !== parent.get(node)) {
-        low.set(node, Math.min(low.get(node), disc.get(neighbor)));
+      } else if (neighbor.node !== parent.get(node)) {
+        low.set(node, Math.min(low.get(node), disc.get(neighbor.node)));
       }
     }
   }
@@ -2161,8 +2254,8 @@ function dfs(graph, node, targets, visited, component) {
   component.add(node);
   visited.add(node);
   targets.forEach((target) => {
-    if (!visited.has(target)) {
-      dfs(graph, target, graph.get(target) || /* @__PURE__ */ new Set(), visited, component);
+    if (!visited.has(target.node)) {
+      dfs(graph, target.node, graph.get(target.node) || /* @__PURE__ */ new Set(), visited, component);
     }
   });
 }
@@ -2220,10 +2313,15 @@ function hasCycle(graph) {
   function dfs2(node) {
     if (visited.has(node)) {
       if (onStack.has(node)) {
-        while (stack[0] !== node) {
-          onStack.delete(stack.shift());
-        }
-        return true;
+        const idx = stack.indexOf(node);
+        const cycle = stack.slice(idx);
+        const allSet = cycle.every((curr, i) => {
+          const next = cycle[(i + 1) % cycle.length];
+          return Array.from(graph.get(curr) || []).some(
+            (edge) => edge.node === next && edge.type === "set"
+          );
+        });
+        return allSet;
       }
       return false;
     }
@@ -2231,7 +2329,7 @@ function hasCycle(graph) {
     onStack.add(node);
     stack.push(node);
     for (const neighbor of graph.get(node) || /* @__PURE__ */ new Set()) {
-      if (dfs2(neighbor)) {
+      if (dfs2(neighbor.node)) {
         return true;
       }
     }
@@ -2340,7 +2438,7 @@ function getVisData(graph, nodesUsedInTemplate, nodesUsedInStyle = /* @__PURE__
   graph.edges.forEach((edge) => {
     edge.forEach((to) => {
       if (to) {
-        inDegreeMap[to.label] = (inDegreeMap[to.label] || 0) + 1;
+        inDegreeMap[to.node.label] = (inDegreeMap[to.node.label] || 0) + 1;
       }
     });
   });
@@ -2374,7 +2472,7 @@ function getVisData(graph, nodesUsedInTemplate, nodesUsedInStyle = /* @__PURE__
       }
       edges.push({
         from: key.label,
-        to: to.label,
+        to: to.node.label,
         arrows: {
           to: {
             enabled: true,