Merge pull request #247 from VisActor/feat/export-sankey-computeHierarchicNodeLinks

feat: export function computeHierarchicNodeLinks for sankey

Author: xuefei1313

common/changes/@visactor/vlayouts/feat-export-sankey-computeHierarchicNodeLinks_2025-07-30-06-30.json

@@ -0,0 +1,11 @@
+{
+  "changes": [
+    {
+      "comment": "feat: export function computeHierarchicNodeLinks for sankey\n\n",
+      "type": "none",
+      "packageName": "@visactor/vlayouts"
+    }
+  ],
+  "packageName": "@visactor/vlayouts",
+  "email": "[email protected]"
+}

packages/vlayouts/src/sankey/hierarchy.ts

@@ -1,4 +1,4 @@
-import { isNil, toValidNumber } from '@visactor/vutils';
+import { isNil, pickWithout, toValidNumber } from '@visactor/vutils';
 
 import type { HierarchyNodeDatum, SankeyLinkDatum, SankeyLinkElement, SankeyNodeElement } from './interface';
 
@@ -71,3 +71,65 @@ export function makeHierarchicNodes(
   doSubTree(originalNodes, 0, null);
   return nodes;
 }
+
+export function computeHierarchicNodeLinks(
+  originalNodes: HierarchyNodeDatum[],
+  nodeKeyFunc: (node: HierarchyNodeDatum) => string
+) {
+  const nodes: SankeyNodeElement[] = [];
+  const links: SankeyLinkElement[] = [];
+  const nodeMap: Record<string | number, SankeyNodeElement> = {};
+  const linkMap: Record<string | number, SankeyLinkElement> = {};
+  const originalLinks: (SankeyLinkDatum & { parents?: SankeyNodeElement[] })[] = [];
+
+  makeHierarchicNodes(originalNodes, nodeKeyFunc, nodes, nodeMap, originalLinks);
+
+  originalLinks.forEach((link, index) => {
+    const key = `${link.source}-${link.target}`;
+    const linkDatum = pickWithout(link, ['parents']);
+
+    (linkDatum as any).parents = link.parents.map(node => {
+      return pickWithout(node, ['sourceLinks', 'targetLinks']);
+    });
+
+    if (linkMap[key]) {
+      linkMap[key].value += toValidNumber(link.value);
+
+      (linkMap[key].datum as SankeyLinkDatum[]).push(linkDatum as SankeyLinkDatum);
+
+      return;
+    }
+    const linkElement = {
+      index,
+      key: `${link.source}-${link.target}`,
+      source: link.source,
+      target: link.target,
+      datum: [linkDatum] as any,
+      value: link.value,
+      parents: link.parents.map(parent => parent.key)
+    };
+
+    links.push(linkElement);
+    nodeMap[link.source].sourceLinks.push(linkElement);
+    nodeMap[link.target].targetLinks.push(linkElement);
+    linkMap[key] = linkElement;
+  });
+
+  return { nodes, links, nodeMap };
+}
+
+export function computeNodeValues(nodes: SankeyNodeElement[]) {
+  for (let i = 0, len = nodes.length; i < len; i++) {
+    const node = nodes[i];
+
+    node.value = Math.max(
+      isNil(node.value) ? 0 : toValidNumber(node.value),
+      node.sourceLinks.reduce((sum, link: SankeyLinkElement) => {
+        return sum + (toValidNumber(link.value) ?? 0);
+      }, 0),
+      node.targetLinks.reduce((sum, link: SankeyLinkElement) => {
+        return sum + (toValidNumber(link.value) ?? 0);
+      }, 0)
+    );
+  }
+}

packages/vlayouts/src/sankey/layout.ts

@@ -12,7 +12,7 @@ import {
   pickWithout,
   toValidNumber
 } from '@visactor/vutils';
-import { makeHierarchicNodes } from './hierarchy';
+import { computeHierarchicNodeLinks, computeNodeValues, makeHierarchicNodes } from './hierarchy';
 import type {
   SankeyData,
   SankeyOptions,
@@ -243,46 +243,7 @@ export class SankeyLayout {
   }
 
   computeHierarchicNodeLinks(originalNodes: HierarchyNodeDatum[]) {
-    const nodes: SankeyNodeElement[] = [];
-    const links: SankeyLinkElement[] = [];
-    const nodeMap: Record<string | number, SankeyNodeElement> = {};
-    const linkMap: Record<string | number, SankeyLinkElement> = {};
-    const originalLinks: (SankeyLinkDatum & { parents?: SankeyNodeElement[] })[] = [];
-
-    makeHierarchicNodes(originalNodes, this._getNodeKey, nodes, nodeMap, originalLinks);
-
-    originalLinks.forEach((link, index) => {
-      const key = `${link.source}-${link.target}`;
-      const linkDatum = pickWithout(link, ['parents']);
-
-      (linkDatum as any).parents = link.parents.map(node => {
-        return pickWithout(node, ['sourceLinks', 'targetLinks']);
-      });
-
-      if (linkMap[key]) {
-        linkMap[key].value += toValidNumber(link.value);
-
-        (linkMap[key].datum as SankeyLinkDatum[]).push(linkDatum as SankeyLinkDatum);
-
-        return;
-      }
-      const linkElement = {
-        index,
-        key: `${link.source}-${link.target}`,
-        source: link.source,
-        target: link.target,
-        datum: [linkDatum] as any,
-        value: link.value,
-        parents: link.parents.map(parent => parent.key)
-      };
-
-      links.push(linkElement);
-      nodeMap[link.source].sourceLinks.push(linkElement);
-      nodeMap[link.target].targetLinks.push(linkElement);
-      linkMap[key] = linkElement;
-    });
-
-    return { nodes, links, nodeMap };
+    return computeHierarchicNodeLinks(originalNodes, this._getNodeKey);
   }
 
   computeSourceTargetNodeLinks(data: { nodes?: SankeyNodeDatum[]; links: SankeyLinkDatum[] }) {
@@ -413,19 +374,7 @@ export class SankeyLayout {
   }
 
   computeNodeValues(nodes: SankeyNodeElement[]) {
-    for (let i = 0, len = nodes.length; i < len; i++) {
-      const node = nodes[i];
-
-      node.value = Math.max(
-        isNil(node.value) ? 0 : toValidNumber(node.value),
-        node.sourceLinks.reduce((sum, link: SankeyLinkElement) => {
-          return sum + (toValidNumber(link.value) ?? 0);
-        }, 0),
-        node.targetLinks.reduce((sum, link: SankeyLinkElement) => {
-          return sum + (toValidNumber(link.value) ?? 0);
-        }, 0)
-      );
-    }
+    return computeNodeValues(nodes);
   }
 
   computeNodeDepths(nodes: SankeyNodeElement[]) {