@antv/layout 2.0.0-alpha.1 → 2.0.0-alpha.3

package/lib/algorithm/radial/radial-nonoverlap-force.js

@@ -0,0 +1,129 @@
+import { parseSize } from '../../util/size.js';
+
+const SPEED_DIVISOR = 800;
+const DEFAULTS_LAYOUT_OPTIONS$1 = {
+    maxIteration: 10,
+    width: 10,
+    speed: 100,
+    gravity: 10,
+    k: 5,
+};
+const radialNonoverlapForce = (model, options) => {
+    const mergedOptions = Object.assign(Object.assign({}, DEFAULTS_LAYOUT_OPTIONS$1), options);
+    const { maxIteration, width, k, speed = DEFAULTS_LAYOUT_OPTIONS$1.speed, strictRadial, focusNode, radiiMap, nodeSizeFunc, } = mergedOptions;
+    const earlyStopThreshold = k * 0.002;
+    const displacements = new Map();
+    const maxDisplacement = width / 10;
+    for (let i = 0; i < maxIteration; i++) {
+        model.forEachNode((node) => {
+            displacements.set(node.id, { x: 0, y: 0 });
+        });
+        // 给重叠的节点增加斥力
+        getRepulsion(model, displacements, k, radiiMap, nodeSizeFunc);
+        const avgDisplacement = updatePositions(model, displacements, speed, strictRadial, focusNode, maxDisplacement, radiiMap);
+        if (avgDisplacement < earlyStopThreshold) {
+            break;
+        }
+    }
+};
+const getRepulsion = (model, displacements, k, radiiMap, nodeSizeFunc) => {
+    let i = 0;
+    model.forEachNode((nodeU) => {
+        let j = 0;
+        model.forEachNode((nodeV) => {
+            if (j <= i) {
+                j++;
+                return;
+            }
+            if (nodeU.id === nodeV.id)
+                return;
+            // nodeU and nodeV are not on the same circle, return
+            if (radiiMap.get(nodeU.id) !== radiiMap.get(nodeV.id))
+                return;
+            let vecx = nodeU.x - nodeV.x;
+            let vecy = nodeU.y - nodeV.y;
+            let vecLength = Math.sqrt(vecx * vecx + vecy * vecy);
+            // If the two nodes are exactly at the same position, we set a small distance between them
+            if (vecLength === 0) {
+                vecLength = 1;
+                const sign = i > j ? 1 : -1;
+                vecx = 0.01 * sign;
+                vecy = 0.01 * sign;
+            }
+            const nodeSizeU = Math.max(...parseSize(nodeSizeFunc(nodeU._original)));
+            const nodeSizeV = Math.max(...parseSize(nodeSizeFunc(nodeV._original)));
+            // these two nodes overlap
+            if (vecLength < nodeSizeV / 2 + nodeSizeU / 2) {
+                const common = (k * k) / vecLength;
+                const dispU = displacements.get(nodeU.id);
+                const dispV = displacements.get(nodeV.id);
+                const deltaX = (vecx / vecLength) * common;
+                const deltaY = (vecy / vecLength) * common;
+                displacements.set(nodeU.id, {
+                    x: dispU.x + deltaX,
+                    y: dispU.y + deltaY,
+                });
+                displacements.set(nodeV.id, {
+                    x: dispV.x - deltaX,
+                    y: dispV.y - deltaY,
+                });
+            }
+            j++;
+        });
+        i++;
+    });
+};
+const updatePositions = (model, displacements, speed, strictRadial, focusNode, maxDisplacement, radiiMap) => {
+    if (strictRadial) {
+        model.forEachNode((node) => {
+            const vx = node.x - focusNode.x;
+            const vy = node.y - focusNode.y;
+            const vLength = Math.sqrt(vx * vx + vy * vy);
+            let vpx = vy / vLength;
+            let vpy = -vx / vLength;
+            const disp = displacements.get(node.id);
+            const diLength = Math.sqrt(disp.x * disp.x + disp.y * disp.y);
+            let alpha = Math.acos((vpx * disp.x + vpy * disp.y) / diLength);
+            if (alpha > Math.PI / 2) {
+                alpha -= Math.PI / 2;
+                vpx *= -1;
+                vpy *= -1;
+            }
+            const tdispLength = Math.cos(alpha) * diLength;
+            displacements.set(node.id, {
+                x: vpx * tdispLength,
+                y: vpy * tdispLength,
+            });
+        });
+    }
+    // move
+    let totalDisplacement = 0;
+    let nodeCount = 0;
+    model.forEachNode((node) => {
+        if (node.id === focusNode.id) {
+            return;
+        }
+        const disp = displacements.get(node.id);
+        const distLength = Math.sqrt(disp.x * disp.x + disp.y * disp.y);
+        if (distLength > 0) {
+            const limitedDist = Math.min(maxDisplacement * (speed / SPEED_DIVISOR), distLength);
+            node.x += (disp.x / distLength) * limitedDist;
+            node.y += (disp.y / distLength) * limitedDist;
+            if (strictRadial) {
+                let vx = node.x - focusNode.x;
+                let vy = node.y - focusNode.y;
+                const nfDis = Math.sqrt(vx * vx + vy * vy);
+                vx = (vx / nfDis) * radiiMap.get(node.id);
+                vy = (vy / nfDis) * radiiMap.get(node.id);
+                node.x = focusNode.x + vx;
+                node.y = focusNode.y + vy;
+            }
+            totalDisplacement += limitedDist;
+            nodeCount++;
+        }
+    });
+    return nodeCount > 0 ? totalDisplacement / nodeCount : 0;
+};
+
+export { radialNonoverlapForce };
+//# sourceMappingURL=radial-nonoverlap-force.js.map

package/lib/algorithm/radial/radial-nonoverlap-force.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"radial-nonoverlap-force.js","sources":["../../../src/algorithm/radial/src/algorithm/radial/radial-nonoverlap-force.ts"],"sourcesContent":[null],"names":["DEFAULTS_LAYOUT_OPTIONS"],"mappings":";;AAIA,MAAM,aAAa,GAAG,GAAG;AAuBzB,MAAMA,yBAAuB,GAA0C;AACrE,IAAA,YAAY,EAAE,EAAE;AAChB,IAAA,KAAK,EAAE,EAAE;AACT,IAAA,KAAK,EAAE,GAAG;AACV,IAAA,OAAO,EAAE,EAAE;AACX,IAAA,CAAC,EAAE,CAAC;CACL;MAEY,qBAAqB,GAAG,CACnC,KAAe,EACf,OAAqC,KACnC;AACF,IAAA,MAAM,aAAa,GAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAQA,yBAAuB,CAAA,EAAK,OAAO,CAAE;IAEhE,MAAM,EACJ,YAAY,EACZ,KAAK,EACL,CAAC,EACD,KAAK,GAAGA,yBAAuB,CAAC,KAAK,EACrC,YAAY,EACZ,SAAS,EACT,QAAQ,EACR,YAAY,GACb,GAAG,aAAa;AACjB,IAAA,MAAM,kBAAkB,GAAG,CAAC,GAAG,KAAK;AAEpC,IAAA,MAAM,aAAa,GAAoB,IAAI,GAAG,EAAE;AAChD,IAAA,MAAM,eAAe,GAAG,KAAK,GAAG,EAAE;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;AACrC,QAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;AACzB,YAAA,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAC5C,QAAA,CAAC,CAAC;;QAGF,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,YAAY,CAAC;AAE7D,QAAA,MAAM,eAAe,GAAG,eAAe,CACrC,KAAK,EACL,aAAa,EACb,KAAM,EACN,YAAY,EACZ,SAAS,EACT,eAAe,EACf,QAAQ,CACT;QAED,IAAI,eAAe,GAAG,kBAAkB,EAAE;YACxC;AACD,QAAA;AACF,IAAA;AACH;AAEA,MAAM,YAAY,GAAG,CACnB,KAAe,EACf,aAA8B,EAC9B,CAAS,EACT,QAAyB,EACzB,YAAoC,KAClC;IACF,IAAI,CAAC,GAAG,CAAC;AAET,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,KAAI;QAC1B,IAAI,CAAC,GAAG,CAAC;AACT,QAAA,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,KAAI;YAC1B,IAAI,CAAC,IAAI,CAAC,EAAE;AACV,gBAAA,CAAC,EAAE;gBACH;AACD,YAAA;AAED,YAAA,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE;gBAAE;;AAG3B,YAAA,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE;YAEvD,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAC5B,YAAA,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;;YAGpD,IAAI,SAAS,KAAK,CAAC,EAAE;gBACnB,SAAS,GAAG,CAAC;AACb,gBAAA,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;AAC3B,gBAAA,IAAI,GAAG,IAAI,GAAG,IAAI;AAClB,gBAAA,IAAI,GAAG,IAAI,GAAG,IAAI;AACnB,YAAA;AAED,YAAA,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;AACvE,YAAA,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;;YAGvE,IAAI,SAAS,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE;gBAC7C,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,SAAS;gBAClC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE;gBAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE;gBAC1C,MAAM,MAAM,GAAG,CAAC,IAAI,GAAG,SAAS,IAAI,MAAM;gBAC1C,MAAM,MAAM,GAAG,CAAC,IAAI,GAAG,SAAS,IAAI,MAAM;AAC1C,gBAAA,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;AAC1B,oBAAA,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;AACnB,oBAAA,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;AACpB,iBAAA,CAAC;AACF,gBAAA,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;AAC1B,oBAAA,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;AACnB,oBAAA,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;AACpB,iBAAA,CAAC;AACH,YAAA;AACD,YAAA,CAAC,EAAE;AACL,QAAA,CAAC,CAAC;AAEF,QAAA,CAAC,EAAE;AACL,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,eAAe,GAAG,CACtB,KAAe,EACf,aAA8B,EAC9B,KAAa,EACb,YAAqB,EACrB,SAAqB,EACrB,eAAuB,EACvB,QAAyB,KACf;AACV,IAAA,IAAI,YAAY,EAAE;AAChB,QAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;YAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;AAC/B,YAAA,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC5C,YAAA,IAAI,GAAG,GAAG,EAAE,GAAG,OAAO;AACtB,YAAA,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,OAAO;YAEvB,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;YACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YAC7D,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC;AAC/D,YAAA,IAAI,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE;AACvB,gBAAA,KAAK,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC;gBACpB,GAAG,IAAI,EAAE;gBACT,GAAG,IAAI,EAAE;AACV,YAAA;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,QAAQ;AAC9C,YAAA,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACzB,CAAC,EAAE,GAAG,GAAG,WAAW;gBACpB,CAAC,EAAE,GAAG,GAAG,WAAW;AACrB,aAAA,CAAC;AACJ,QAAA,CAAC,CAAC;AACH,IAAA;;IAGD,IAAI,iBAAiB,GAAG,CAAC;IACzB,IAAI,SAAS,GAAG,CAAC;AAEjB,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;AACzB,QAAA,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,EAAE;YAC5B;AACD,QAAA;QAED,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAE/D,IAAI,UAAU,GAAG,CAAC,EAAE;AAClB,YAAA,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,eAAe,IAAI,KAAK,GAAG,aAAa,CAAC,EACzC,UAAU,CACX;AACD,YAAA,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,WAAW;AAC7C,YAAA,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,WAAW;AAE7C,YAAA,IAAI,YAAY,EAAE;gBAChB,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;gBAC7B,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;AAC7B,gBAAA,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC1C,gBAAA,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;AAC1C,gBAAA,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;gBAC1C,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE;gBACzB,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE;AAC1B,YAAA;YAED,iBAAiB,IAAI,WAAW;AAChC,YAAA,SAAS,EAAE;AACZ,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,SAAS,GAAG,CAAC,GAAG,iBAAiB,GAAG,SAAS,GAAG,CAAC;AAC1D,CAAC;;;;"}

package/lib/algorithm/radial/types.d.ts

@@ -0,0 +1,103 @@
+import { BaseLayoutOptions } from '../types.js';
+import { NodeData } from '../../types/data.js';
+import { Size } from '../../types/size.js';
+
+/**
+ * <zh/> Radial 辐射布局的配置项
+ *
+ * <en/> Configuration items for Radial layout
+ */
+interface RadialLayoutOptions extends BaseLayoutOptions {
+    /**
+     * <zh/> 边长度
+     *
+     * <en/> Edge length
+     * @defaultValue 50
+     */
+    linkDistance?: number;
+    /**
+     * <zh/> 辐射的中心点
+     * - string: 节点 id
+     * - null: 数据中第一个节点
+     * <en/> The center point of the radiation
+     * - string: node id
+     * - null: the first node in the data
+     */
+    focusNode?: string | null;
+    /**
+     * <zh/> 每一圈距离上一圈的距离。默认填充整个画布，即根据图的大小决定
+     *
+     * <en/> The distance between each ring. Defaults to filling the entire canvas, i.e., determined by the size of the graph
+     * @defaultValue 100
+     */
+    unitRadius?: number | null;
+    /**
+     * <zh/> 是否防止重叠
+     *
+     * <en/> Whether to prevent overlap
+     * @remarks
+     * <zh/> 必须配合下面属性 nodeSize 或节点数据中的 data.size 属性，只有在数据中设置了 data.size 或在该布局中配置了与当前图节点大小相同的 nodeSize 值，才能够进行节点重叠的碰撞检测
+     *
+     * <en/> Must be used with the following properties: nodeSize or data.size in the node data. Only when data.size or nodeSize with the same value as the current graph node size is set in the layout configuration, can the collision detection of node overlap be performed
+     * @defaultValue false
+     */
+    preventOverlap?: boolean;
+    /**
+     * <zh/> 节点大小（直径）。用于防止节点重叠时的碰撞检测
+     *
+     * <en/> Node size (diameter). Used for collision detection when preventing node overlap
+     */
+    nodeSize?: Size | ((d?: NodeData) => Size);
+    /**
+     * <zh/> preventOverlap 为 true 时生效, 防止重叠时节点边缘间距的最小值。可以是回调函数, 为不同节点设置不同的最小间距
+     *
+     * <en/> Effective when preventOverlap is true. The minimum edge spacing when preventing node overlap. It can be a callback function, and set different minimum spacing for different nodes
+     * @defaultValue 10
+     */
+    nodeSpacing?: number | ((d?: NodeData) => number);
+    /**
+     * <zh/> 防止重叠步骤的最大迭代次数
+     *
+     * <en/> Maximum iteration number of the prevent overlap step
+     * @defaultValue 200
+     */
+    maxPreventOverlapIteration?: number;
+    /**
+     * <zh/> 是否必须是严格的 radial 布局，及每一层的节点严格布局在一个环上。preventOverlap 为 true 时生效。
+     *
+     * <en/> Whether it must be a strict radial layout, that is, each layer of nodes strictly layout on a ring. Effective when preventOverlap is true.
+     * @remarks
+     * <zh/> 当 preventOverlap 为 true，且 strictRadial 为 false 时，有重叠的节点严格沿着所在的环展开，但在一个环上若节点过多，可能无法完全避免节点重叠 当 preventOverlap 为 true，且 strictRadial 为 true 时，允许同环上重叠的节点不严格沿着该环布局，可以在该环的前后偏移以避免重叠
+     *
+     * <en/> When preventOverlap is true and strictRadial is false, overlapping nodes are strictly laid out along the ring they are in. However, if there are too many nodes on a ring, it may not be possible to completely avoid node overlap. When preventOverlap is true and strictRadial is true, overlapping nodes on the same ring are allowed to be laid out not strictly along the ring, and can be offset before and after the ring to avoid overlap
+     * @defaultValue true
+     */
+    strictRadial?: boolean;
+    /**
+     * <zh/> 同层节点布局后相距远近的依据
+     *
+     * <en/> The basis for the distance between nodes in the same layer after layout
+     * @remarks
+     * <zh/> 默认 undefined ，表示根据数据的拓扑结构（节点间最短路径）排布，即关系越近/点对间最短路径越小的节点将会被尽可能排列在一起；'data' 表示按照节点在数据中的顺序排列，即在数据顺序上靠近的节点将会尽可能排列在一起；也可以指定为节点数据中的某个字段名，例如 'cluster'、'name' 等（必须在数据的 data 中存在）
+     *
+     * <en/> The default is undefined, which means arranging based on the topological structure of the data (the shortest path between nodes). Nodes that are closer in proximity or have a smaller shortest path between them will be arranged as close together as possible. 'data' indicates arranging based on the order of nodes in the data, so nodes that are closer in the data order will be arranged as close together as possible. You can also specify a field name in the node data, such as 'cluster' or 'name' (it must exist in the data of the graph)
+     * @defaultValue undefined
+     */
+    sortBy?: 'data' | ((d?: NodeData) => number | string);
+    /**
+     * <zh/> 同层节点根据 sortBy 排列的强度，数值越大，sortBy 指定的方式计算出距离越小的越靠近。sortBy 不为 undefined 时生效
+     *
+     * <en/> The strength of arranging nodes according to sortBy. The larger the value, the closer the nodes that sortBy specifies are arranged. It takes effect when sortBy is not undefined
+     * @defaultValue 10
+     */
+    sortStrength?: number;
+    /**
+     * <zh/> 停止迭代到最大迭代数
+     *
+     * <en/> Stop iterating until the maximum iteration number is reached
+     * @defaultValue 1000
+     */
+    maxIteration?: number;
+}
+
+export type { RadialLayoutOptions };

package/lib/algorithm/random/index.d.ts

@@ -0,0 +1,15 @@
+import { BaseLayout } from '../base-layout.js';
+import { RandomLayoutOptions } from './types.js';
+
+/**
+ * <zh/> 随机布局
+ *
+ * <en/> Random layout
+ */
+declare class RandomLayout extends BaseLayout<RandomLayoutOptions> {
+    id: string;
+    protected getDefaultOptions(): Partial<RandomLayoutOptions>;
+    protected layout(): Promise<void>;
+}
+
+export { RandomLayout, RandomLayoutOptions };

package/lib/algorithm/random/index.js

@@ -0,0 +1,41 @@
+import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';
+import { normalizeViewport } from '../../util/viewport.js';
+import { BaseLayout } from '../base-layout.js';
+
+/**
+ * <zh/> 随机布局
+ *
+ * <en/> Random layout
+ */
+class RandomLayout extends BaseLayout {
+    constructor() {
+        super(...arguments);
+        this.id = 'random';
+    }
+    getDefaultOptions() {
+        return {
+            center: [0, 0],
+            width: 300,
+            height: 300,
+        };
+    }
+    layout() {
+        return __awaiter(this, void 0, void 0, function* () {
+            const { width, height, center } = normalizeViewport(this.options);
+            this.model.forEachNode((node) => {
+                node.x = randomCoord(width) + center[0];
+                node.y = randomCoord(height) + center[1];
+            });
+        });
+    }
+}
+const layoutScale = 0.9;
+/**
+ * <zh/> 生成随机坐标
+ *
+ * <en/> Generate random coordinates
+ */
+const randomCoord = (size) => (Math.random() - 0.5) * layoutScale * size;
+
+export { RandomLayout };
+//# sourceMappingURL=index.js.map

package/lib/algorithm/random/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../src/algorithm/random/src/algorithm/random/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAMA;;;;AAIG;AACG,MAAO,YAAa,SAAQ,UAA+B,CAAA;AAAjE,IAAA,WAAA,GAAA;;QACE,IAAA,CAAA,EAAE,GAAG,QAAQ;IAkBf;IAhBY,iBAAiB,GAAA;QACzB,OAAO;AACL,YAAA,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACd,YAAA,KAAK,EAAE,GAAG;AACV,YAAA,MAAM,EAAE,GAAG;SACZ;IACH;IAEgB,MAAM,GAAA;;AACpB,YAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC;YAEjE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;AAC9B,gBAAA,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AACvC,gBAAA,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC1C,YAAA,CAAC,CAAC;QACJ,CAAC,CAAA;AAAA,IAAA;AACF;AAED,MAAM,WAAW,GAAG,GAAG;AAEvB;;;;AAIG;AACH,MAAM,WAAW,GAAG,CAAC,IAAY,KAC/B,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI;;;;"}

package/lib/algorithm/random/types.d.ts

@@ -0,0 +1,11 @@
+import { BaseLayoutOptions } from '../types.js';
+
+/**
+ * <zh/> 随机布局配置
+ *
+ * <en/> Random layout configuration
+ */
+interface RandomLayoutOptions extends BaseLayoutOptions {
+}
+
+export type { RandomLayoutOptions };

package/lib/algorithm/types.d.ts

@@ -0,0 +1,142 @@
+import { NodeData, EdgeData, GraphData, GraphNode, GraphEdge } from '../types/data.js';
+import { ID } from '../types/id.js';
+import { Point } from '../types/point.js';
+
+interface DataOptions<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+    /**
+     * <zh/> 自定义节点属性映射
+     *
+     * <en/> Custom node field mapping
+     */
+    node?: (datum: N) => {
+        id?: ID;
+        x?: number;
+        y?: number;
+        z?: number;
+        parentId?: ID | null;
+        isCombo?: boolean;
+    };
+    /**
+     * <zh/> 自定义边属性映射
+     *
+     * <en/> Custom edge field mapping
+     */
+    edge?: (datum: E) => {
+        id?: ID;
+        source?: ID;
+        target?: ID;
+    };
+}
+interface BaseLayoutOptions<N extends NodeData = NodeData, E extends EdgeData = EdgeData> extends DataOptions<N, E> {
+    /**
+     * <zh/> 布局中心
+     *
+     * <en/> Layout center
+     */
+    center?: Point;
+    /**
+     * <zh/> 布局宽度
+     *
+     * <en/> Layout width
+     */
+    width?: number;
+    /**
+     * <zh/> 布局高度
+     *
+     * <en/> Layout height
+     */
+    height?: number;
+    /**
+     * <zh/> 是否启用 WebWorker
+     *
+     * <en/> Whether to run the layout in a WebWorker
+     */
+    enableWorker?: boolean;
+    [key: string]: any;
+}
+interface Layout<O extends BaseLayoutOptions = BaseLayoutOptions> {
+    /**
+     * <zh/> 执行布局计算
+     *
+     * <en/> Execute layout calculation
+     */
+    execute(graph: GraphData, options?: O): Promise<void>;
+    /**
+     * <zh/> 遍历节点布局结果
+     *
+     * <en/> Iterate over node layout results
+     */
+    forEachNode(callback: (node: GraphNode) => void): void;
+    /**
+     * <zh/> 遍历边布局结果
+     *
+     * <en/> Iterate over edge layout results
+     */
+    forEachEdge(callback: (edge: GraphEdge) => void): void;
+    /**
+     * <zh/> 布局计算的配置项
+     *
+     * <en/> Layout calculation configuration item
+     */
+    options: O;
+    /**
+     * <zh/> 布局id
+     *
+     * <en/> Layout id
+     */
+    id: string;
+}
+interface LayoutWithIterations<O extends BaseLayoutOptions = BaseLayoutOptions> extends Layout<O> {
+    /**
+     * <zh/> 停止布局计算
+     *
+     * <en/> Stop the layout calculation
+     * @description
+     * Some layout algorithm has n iterations so that the simulation needs to be stopped at any time.
+     * This method is useful for running the simulation manually.
+     */
+    stop(): void;
+    /**
+     * <zh/> 手动推进布局计算若干步
+     *
+     * <en/> Manually steps the simulation by the specified number of iterations.
+     */
+    tick(iterations?: number): void;
+    /**
+     * <zh/> 重置布局计算
+     *
+     * <en/> Restart the layout calculation
+     */
+    restart(): void;
+    /**
+     * <zh/> 设置节点固定位置，在布局过程中该节点不会被移动
+     *
+     * <en/> Set the fixed position of a node. The node will not be moved during the layout process.
+     */
+    setFixedPosition(nodeId: string, position: Point | null): void;
+}
+interface SimulationOptions {
+    /**
+     * <zh/> 最大迭代次数，若为 0 则将自动调整
+     *
+     * <en/> Maximum number of iterations, if it is 0, it will be automatically adjusted
+     * @defaultValue 0
+     */
+    maxIteration?: number;
+    /**
+     * <zh/> 当一次迭代的平均/最大/最小（根据distanceThresholdMode决定）移动长度小于该值时停止迭代。数字越小，布局越收敛，所用时间将越长
+     *
+     * <en/> When the average/max/min (depending on distanceThresholdMode) movement length of one iteration is less than this value, the iteration will stop. The smaller the number, the more converged the layout, and the longer the time it takes to use
+     * @defaultValue 0.4
+     */
+    minMovement?: number;
+    /**
+     * <zh/> 是否启用动画模式：动画模式下布局过程会被分解为多次迭代并通过定时器执行，从而可以在布局过程中看到节点的移动过程；非动画模式下布局将在一次函数调用中完成所有迭代
+     *
+     * <en/> Whether to enable animation mode： in animation mode, the layout process will be decomposed into multiple iterations and executed through a timer, so that you can see the movement process of the nodes during the layout; in non-animation mode, the layout will complete all iterations in one function call
+     * @defaultValue true
+     */
+    animate?: boolean;
+}
+
+export type { BaseLayoutOptions, DataOptions, Layout, LayoutWithIterations, SimulationOptions };

package/lib/index.d.ts

@@ -1,22 +1,26 @@
-export { AntVDagreLayout } from './antv-dagre/index.js';
-export { AntVDagreLayoutOptions, DagreAlign, DagreRankdir } from './antv-dagre/types.js';
-export { CircularLayout } from './circular/index.js';
-export { ComboCombinedLayout } from './combo-combined/index.js';
-export { ConcentricLayout } from './concentric/index.js';
-export { BaseLayout } from './core/base-layout.js';
-export { D3ForceLayout } from './d3-force/index.js';
-export { D3Force3DLayout } from './d3-force-3d/index.js';
-export { DagreLayout } from './dagre/index.js';
-export { ForceLayout } from './force/index.js';
-export { ForceAtlas2Layout } from './force-atlas2/index.js';
-export { FruchtermanLayout } from './fruchterman/index.js';
-export { GridLayout } from './grid/index.js';
-export { MDSLayout } from './mds/index.js';
-export { RadialLayout } from './radial/index.js';
-export { RandomLayout } from './random/index.js';
+export { AntVDagreLayout } from './algorithm/antv-dagre/index.js';
+export { BaseLayout, isLayoutWithIterations } from './algorithm/base-layout.js';
+export { CircularLayout } from './algorithm/circular/index.js';
+export { ComboCombinedLayout } from './algorithm/combo-combined/index.js';
+export { ConcentricLayout } from './algorithm/concentric/index.js';
+export { D3ForceLayout } from './algorithm/d3-force/index.js';
+export { D3Force3DLayout } from './algorithm/d3-force-3d/index.js';
+export { DagreLayout } from './algorithm/dagre/index.js';
+export { ForceLayout } from './algorithm/force/index.js';
+export { ForceAtlas2Layout } from './algorithm/force-atlas2/index.js';
+export { FruchtermanLayout } from './algorithm/fruchterman/index.js';
+export { GridLayout } from './algorithm/grid/index.js';
+export { MDSLayout } from './algorithm/mds/index.js';
+export { RadialLayout } from './algorithm/radial/index.js';
+export { RandomLayout } from './algorithm/random/index.js';
+export { BaseLayoutOptions, DataOptions, Layout, LayoutWithIterations, SimulationOptions } from './algorithm/types.js';
+export { GraphLib, initNodePosition } from './model/data.js';
 export { registry } from './registry.js';
+export { RuntimeContext } from './runtime/context.js';
+export { Supervisor } from './runtime/supervisor.js';
 export { Matrix, PlainObject } from './types/common.js';
-export { EdgeData, GraphData, LayoutData, LayoutEdge, LayoutNode, NodeData } from './types/data.js';
+export { EdgeData, Graph, GraphData, GraphEdge, GraphNode, LayoutData, LayoutEdge, LayoutNode, NodeData } from './types/data.js';
+export { EdgeLabelPos } from './types/edge-label.js';
 export { CommonForceLayoutOptions, DisplacementMap, DistanceThresholdMode } from './types/force.js';
 export { ID } from './types/id.js';
 export { Point, PointObject, STDPoint } from './types/point.js';
@@ -25,23 +29,22 @@ export { STDSize, Size } from './types/size.js';
 export { isArray } from './util/array.js';
 export { applySingleNodeLayout } from './util/common.js';
 export { floydWarshall, getAdjList, getAdjMatrix, getEuclideanDistance, getLayoutBBox, graphTreeDfs, johnson, scaleMatrix } from './util/math.js';
-export { LayoutModel, initModelNodePosition } from './util/model.js';
-export { assignDefined, getNestedValue, mergeOptions, setNestedValue } from './util/object.js';
+export { assignDefined, getNestedValue, setNestedValue } from './util/object.js';
 export { SortComparator, orderByDegree, orderById, orderBySorter, orderByTopology } from './util/order.js';
 export { parsePoint, toPointObject } from './util/point.js';
 export { parseSize } from './util/size.js';
 export { normalizeViewport } from './util/viewport.js';
-export { CircularLayoutOptions } from './circular/types.js';
-export { ComboCombinedLayoutOptions } from './combo-combined/types.js';
-export { ConcentricLayoutOptions } from './concentric/types.js';
-export { BaseLayoutOptions } from './core/types.js';
-export { D3ForceLayoutOptions } from './d3-force/types.js';
-export { D3Force3DLayoutOptions } from './d3-force-3d/types.js';
-export { DagreLayoutOptions } from './dagre/types.js';
-export { ForceLayoutOptions } from './force/types.js';
-export { ForceAtlas2LayoutOptions } from './force-atlas2/types.js';
-export { FruchtermanLayoutOptions } from './fruchterman/types.js';
-export { GridLayoutOptions } from './grid/types.js';
-export { MDSLayoutOptions } from './mds/types.js';
-export { RadialLayoutOptions } from './radial/types.js';
-export { RandomLayoutOptions } from './random/types.js';
+export { AntVDagreLayoutOptions } from './algorithm/antv-dagre/types.js';
+export { CircularLayoutOptions } from './algorithm/circular/types.js';
+export { ComboCombinedLayoutOptions } from './algorithm/combo-combined/types.js';
+export { ConcentricLayoutOptions } from './algorithm/concentric/types.js';
+export { D3ForceLayoutOptions } from './algorithm/d3-force/types.js';
+export { D3Force3DLayoutOptions } from './algorithm/d3-force-3d/types.js';
+export { DagreLayoutOptions } from './algorithm/dagre/types.js';
+export { ForceLayoutOptions } from './algorithm/force/types.js';
+export { ForceAtlas2LayoutOptions } from './algorithm/force-atlas2/types.js';
+export { FruchtermanLayoutOptions } from './algorithm/fruchterman/types.js';
+export { GridLayoutOptions } from './algorithm/grid/types.js';
+export { MDSLayoutOptions } from './algorithm/mds/types.js';
+export { RadialLayoutOptions } from './algorithm/radial/types.js';
+export { RandomLayoutOptions } from './algorithm/random/types.js';

package/lib/index.js

@@ -1,24 +1,26 @@
-export { AntVDagreLayout } from './antv-dagre/index.js';
-export { CircularLayout } from './circular/index.js';
-export { ComboCombinedLayout } from './combo-combined/index.js';
-export { ConcentricLayout } from './concentric/index.js';
-export { BaseLayout } from './core/base-layout.js';
-export { D3ForceLayout } from './d3-force/index.js';
-export { D3Force3DLayout } from './d3-force-3d/index.js';
-export { DagreLayout } from './dagre/index.js';
-export { ForceLayout } from './force/index.js';
-export { ForceAtlas2Layout } from './force-atlas2/index.js';
-export { FruchtermanLayout } from './fruchterman/index.js';
-export { GridLayout } from './grid/index.js';
-export { MDSLayout } from './mds/index.js';
-export { RadialLayout } from './radial/index.js';
-export { RandomLayout } from './random/index.js';
+export { AntVDagreLayout } from './algorithm/antv-dagre/index.js';
+export { BaseLayout, isLayoutWithIterations } from './algorithm/base-layout.js';
+export { CircularLayout } from './algorithm/circular/index.js';
+export { ComboCombinedLayout } from './algorithm/combo-combined/index.js';
+export { ConcentricLayout } from './algorithm/concentric/index.js';
+export { D3ForceLayout } from './algorithm/d3-force/index.js';
+export { D3Force3DLayout } from './algorithm/d3-force-3d/index.js';
+export { DagreLayout } from './algorithm/dagre/index.js';
+export { ForceLayout } from './algorithm/force/index.js';
+export { ForceAtlas2Layout } from './algorithm/force-atlas2/index.js';
+export { FruchtermanLayout } from './algorithm/fruchterman/index.js';
+export { GridLayout } from './algorithm/grid/index.js';
+export { MDSLayout } from './algorithm/mds/index.js';
+export { RadialLayout } from './algorithm/radial/index.js';
+export { RandomLayout } from './algorithm/random/index.js';
+export { GraphLib, initNodePosition } from './model/data.js';
 export { registry } from './registry.js';
+export { RuntimeContext } from './runtime/context.js';
+export { Supervisor } from './runtime/supervisor.js';
 export { isArray } from './util/array.js';
 export { applySingleNodeLayout } from './util/common.js';
 export { floydWarshall, getAdjList, getAdjMatrix, getEuclideanDistance, getLayoutBBox, graphTreeDfs, johnson, scaleMatrix } from './util/math.js';
-export { LayoutModel, initModelNodePosition } from './util/model.js';
-export { assignDefined, getNestedValue, mergeOptions, setNestedValue } from './util/object.js';
+export { assignDefined, getNestedValue, setNestedValue } from './util/object.js';
 export { orderByDegree, orderById, orderBySorter, orderByTopology } from './util/order.js';
 export { parsePoint, toPointObject } from './util/point.js';
 export { parseSize } from './util/size.js';

package/lib/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/lib/model/data.d.ts

@@ -0,0 +1,46 @@
+import { DataOptions } from '../algorithm/types.js';
+import { NodeData, EdgeData, GraphNode, GraphEdge, GraphData, Graph } from '../types/data.js';
+import { ID } from '../types/id.js';
+
+declare class GraphLib<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+    nodeMap: Map<ID, GraphNode<N>>;
+    edgeMap: Map<ID, GraphEdge<E>>;
+    private degreeCache?;
+    private inAdjacencyCache?;
+    private outAdjacencyCache?;
+    private bothAdjacencyCache?;
+    private nodeIndexCache?;
+    private indexNodeCache?;
+    private edgeIdCounter;
+    constructor(data: GraphData<N, E>, options?: DataOptions<N, E>);
+    data(): Graph<N, E>;
+    replace(result: Graph<N, E>): void;
+    nodes(): GraphNode<N>[];
+    node(id: ID): GraphNode<N> | undefined;
+    nodeAt(index: number): GraphNode<N> | undefined;
+    nodeIndexOf(id: ID): number;
+    firstNode(): GraphNode<N> | undefined;
+    forEachNode(callback: (node: GraphNode<N>, index: number) => void): void;
+    originalNode(id: ID): N | undefined;
+    nodeCount(): number;
+    edges(): GraphEdge<E>[];
+    edge(id: ID): GraphEdge<E> | undefined;
+    firstEdge(): GraphEdge<E> | undefined;
+    forEachEdge(callback: (edge: GraphEdge<E>, index: number) => void): void;
+    originalEdge(id: ID): E | undefined;
+    edgeCount(): number;
+    getEdgeId(edge: E): string;
+    degree(nodeId: ID, direction?: 'in' | 'out' | 'both'): number;
+    neighbors(nodeId: ID, direction?: 'in' | 'out' | 'both'): ID[];
+    successors(nodeId: ID): ID[];
+    predecessors(nodeId: ID): ID[];
+    setNodeOrder(nodes: GraphNode<N>[]): void;
+    clearCache(): void;
+    private buildDegreeCache;
+    private buildAdjacencyCache;
+    private buildNodeIndexCache;
+    destroy(): void;
+}
+declare function initNodePosition<N extends NodeData = NodeData>(model: GraphLib<N>, width: number, height: number, dimensions?: 2 | 3): void;
+
+export { GraphLib, initNodePosition };