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

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

@@ -0,0 +1,265 @@
+import { DagreGraph } from './graph.js';
+import isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';
+
+const safeSort = (valueA, valueB) => {
+    return Number(valueA) - Number(valueB);
+};
+/*
+ * Adds a dummy node to the graph and return v.
+ */
+const addDummyNode = (g, type, data, name) => {
+    let v;
+    do {
+        v = `${name}${Math.random()}`;
+    } while (g.hasNode(v));
+    data.dummy = type;
+    g.addNode({
+        id: v,
+        data,
+    });
+    return v;
+};
+/*
+ * Returns a new graph with only simple edges. Handles aggregation of data
+ * associated with multi-edges.
+ */
+const simplify = (g) => {
+    const simplified = new DagreGraph();
+    g.getAllNodes().forEach((v) => {
+        simplified.addNode(Object.assign({}, v));
+    });
+    g.getAllEdges().forEach((e) => {
+        const edge = simplified
+            .getRelatedEdges(e.source, 'out')
+            .find((edge) => edge.target === e.target);
+        if (!edge) {
+            simplified.addEdge({
+                id: e.id,
+                source: e.source,
+                target: e.target,
+                data: {
+                    weight: e.data.weight || 0,
+                    minlen: e.data.minlen || 1,
+                },
+            });
+        }
+        else {
+            simplified.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + e.data.weight || 0, minlen: Math.max(edge.data.minlen, e.data.minlen || 1) }));
+        }
+    });
+    return simplified;
+};
+const asNonCompoundGraph = (g) => {
+    const simplified = new DagreGraph();
+    g.getAllNodes().forEach((node) => {
+        if (!g.getChildren(node.id).length) {
+            simplified.addNode(Object.assign({}, node));
+        }
+    });
+    g.getAllEdges().forEach((edge) => {
+        simplified.addEdge(edge);
+    });
+    return simplified;
+};
+const zipObject = (keys, values) => {
+    return keys === null || keys === void 0 ? void 0 : keys.reduce((obj, key, i) => {
+        obj[key] = values[i];
+        return obj;
+    }, {});
+};
+/*
+ * Finds where a line starting at point ({x, y}) would intersect a rectangle
+ * ({x, y, width, height}) if it were pointing at the rectangle's center.
+ */
+const intersectRect = (rect, point) => {
+    const x = Number(rect.x);
+    const y = Number(rect.y);
+    // Rectangle intersection algorithm from:
+    // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
+    const dx = Number(point.x) - x;
+    const dy = Number(point.y) - y;
+    let w = Number(rect.width) / 2;
+    let h = Number(rect.height) / 2;
+    if (!dx && !dy) {
+        // completely overlapped directly, then return points its self
+        return { x: 0, y: 0 };
+    }
+    let sx;
+    let sy;
+    if (Math.abs(dy) * w > Math.abs(dx) * h) {
+        // Intersection is top or bottom of rect.
+        if (dy < 0) {
+            h = -h;
+        }
+        sx = (h * dx) / dy;
+        sy = h;
+    }
+    else {
+        // Intersection is left or right of rect.
+        if (dx < 0) {
+            w = -w;
+        }
+        sx = w;
+        sy = (w * dy) / dx;
+    }
+    return { x: x + sx, y: y + sy };
+};
+/*
+ * Given a DAG with each node assigned "rank" and "order" properties, this
+ * const will produce a matrix with the ids of each node.
+ */
+const buildLayerMatrix = (g) => {
+    const layeringNodes = [];
+    const rankMax = maxRank(g) + 1;
+    for (let i = 0; i < rankMax; i++) {
+        layeringNodes.push([]);
+    }
+    // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
+    g.getAllNodes().forEach((node) => {
+        const rank = node.data.rank;
+        if (rank !== undefined && layeringNodes[rank]) {
+            layeringNodes[rank].push(node.id);
+        }
+    });
+    for (let i = 0; i < rankMax; i++) {
+        layeringNodes[i] = layeringNodes[i].sort((va, vb) => safeSort(g.getNode(va).data.order, g.getNode(vb).data.order));
+    }
+    return layeringNodes;
+};
+/*
+ * Adjusts the ranks for all nodes in the graph such that all nodes v have
+ * rank(v) >= 0 and at least one node w has rank(w) = 0.
+ */
+const normalizeRanks = (g) => {
+    const nodeRanks = g
+        .getAllNodes()
+        .filter((v) => v.data.rank !== undefined)
+        .map((v) => v.data.rank);
+    const min = Math.min(...nodeRanks);
+    g.getAllNodes().forEach((v) => {
+        if (v.data.hasOwnProperty('rank') && min !== Infinity) {
+            v.data.rank -= min;
+        }
+    });
+};
+const removeEmptyRanks = (g, nodeRankFactor = 0) => {
+    // Ranks may not start at 0, so we need to offset them
+    const nodes = g.getAllNodes();
+    const nodeRanks = nodes
+        .filter((v) => v.data.rank !== undefined)
+        .map((v) => v.data.rank);
+    const offset = Math.min(...nodeRanks);
+    const layers = [];
+    nodes.forEach((v) => {
+        const rank = (v.data.rank || 0) - offset;
+        if (!layers[rank]) {
+            layers[rank] = [];
+        }
+        layers[rank].push(v.id);
+    });
+    let delta = 0;
+    for (let i = 0; i < layers.length; i++) {
+        const vs = layers[i];
+        if (vs === undefined) {
+            if (i % nodeRankFactor !== 0) {
+                delta -= 1;
+            }
+        }
+        else if (delta) {
+            vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
+                const node = g.getNode(v);
+                if (node) {
+                    node.data.rank = node.data.rank || 0;
+                    node.data.rank += delta;
+                }
+            });
+        }
+    }
+};
+const addBorderNode$1 = (g, prefix, rank, order) => {
+    const node = {
+        width: 0,
+        height: 0,
+    };
+    if (isNumber(rank) && isNumber(order)) {
+        node.rank = rank;
+        node.order = order;
+    }
+    return addDummyNode(g, 'border', node, prefix);
+};
+const maxRank = (g) => {
+    let maxRank;
+    g.getAllNodes().forEach((v) => {
+        const rank = v.data.rank;
+        if (rank !== undefined) {
+            if (maxRank === undefined || rank > maxRank) {
+                maxRank = rank;
+            }
+        }
+    });
+    if (!maxRank) {
+        maxRank = 0;
+    }
+    return maxRank;
+};
+/*
+ * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
+ * const returns true for an entry it goes into `lhs`. Otherwise it goes
+ * into `rhs.
+ */
+const partition = (collection, fn) => {
+    const result = { lhs: [], rhs: [] };
+    collection === null || collection === void 0 ? void 0 : collection.forEach((value) => {
+        if (fn(value)) {
+            result.lhs.push(value);
+        }
+        else {
+            result.rhs.push(value);
+        }
+    });
+    return result;
+};
+const minBy = (array, func) => {
+    return array.reduce((a, b) => {
+        const valA = func(a);
+        const valB = func(b);
+        return valA > valB ? b : a;
+    });
+};
+const doDFS = (graph, node, postorder, visited, navigator, result) => {
+    if (!visited.includes(node.id)) {
+        visited.push(node.id);
+        if (!postorder) {
+            result.push(node.id);
+        }
+        const neighbors = navigator(node.id);
+        if (neighbors) {
+            neighbors.forEach((n) => doDFS(graph, n, postorder, visited, navigator, result));
+        }
+        if (postorder) {
+            result.push(node.id);
+        }
+    }
+};
+/**
+ * @description DFS traversal.
+ * @description.zh-CN DFS 遍历。
+ */
+const dfs$1 = (graph, node, order, isDirected) => {
+    const nodes = Array.isArray(node) ? node : [node];
+    const navigator = (n) => graph.getNeighbors(n);
+    const results = [];
+    const visited = [];
+    nodes.forEach((node) => {
+        if (!graph.hasNode(node.id)) {
+            throw new Error(`Graph does not have node: ${node}`);
+        }
+        else {
+            doDFS(graph, node, order === 'post', visited, navigator, results);
+        }
+    });
+    return results;
+};
+
+export { addBorderNode$1 as addBorderNode, addDummyNode, asNonCompoundGraph, buildLayerMatrix, dfs$1 as dfs, intersectRect, maxRank, minBy, normalizeRanks, partition, removeEmptyRanks, simplify, zipObject };
+//# sourceMappingURL=util.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/util.ts"],"sourcesContent":[null],"names":["addBorderNode","dfs"],"mappings":";;;AAKA,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAE,MAAe,KAAI;IACpD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;AACxC,CAAC;AAED;;AAEG;AACI,MAAM,YAAY,GAAG,CAC1B,CAAa,EACb,IAAY,EACZ,IAAc,EACd,IAAY,KACN;AACN,IAAA,IAAI,CAAK;IACT,GAAG;QACD,CAAC,GAAG,GAAG,IAAI,CAAA,EAAG,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AAC9B,IAAA,CAAA,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AAErB,IAAA,IAAI,CAAC,KAAK,GAAG,IAAI;IACjB,CAAC,CAAC,OAAO,CAAC;AACR,QAAA,EAAE,EAAE,CAAC;QACL,IAAI;AACL,KAAA,CAAC;AAEF,IAAA,OAAO,CAAC;AACV;AAEA;;;AAGG;AACI,MAAM,QAAQ,GAAG,CAAC,CAAa,KAAI;AACxC,IAAA,MAAM,UAAU,GAAG,IAAI,UAAU,EAAsB;IACvD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,UAAU,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,CAAC,EAAG;AAC9B,IAAA,CAAC,CAAC;IACF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,MAAM,IAAI,GAAG;AACV,aAAA,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK;AAC/B,aAAA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC;QAC3C,IAAI,CAAC,IAAI,EAAE;YACT,UAAU,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;AAChB,gBAAA,IAAI,EAAE;AACJ,oBAAA,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;AAC3B,oBAAA,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;AAC5B,iBAAA;AACF,aAAA,CAAC;AACH,QAAA;AAAM,aAAA;YACL,UAAU,CAAC,cAAc,CAAC,IAAI,KAAA,IAAA,IAAJ,IAAI,KAAA,MAAA,GAAA,MAAA,GAAJ,IAAI,CAAE,EAAG,EAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAC9B,IAAI,CAAC,IAAI,CAAA,EAAA,EACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,EAC/C,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,EAAA,CAAA,CACxD;AACH,QAAA;AACH,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,UAAU;AACnB;AAEO,MAAM,kBAAkB,GAAG,CAAC,CAAa,KAAgB;AAC9D,IAAA,MAAM,UAAU,GAAG,IAAI,UAAU,EAAE;IAEnC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QAC/B,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;AAClC,YAAA,UAAU,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,IAAI,EAAG;AAChC,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AAC/B,QAAA,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC;AAC1B,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,UAAU;AACnB;MAEa,SAAS,GAAG,CAAU,IAAU,EAAE,MAAW,KAAI;AAC5D,IAAA,OAAO,IAAI,KAAA,IAAA,IAAJ,IAAI,KAAA,MAAA,GAAA,MAAA,GAAJ,IAAI,CAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,KAAI;QAClC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AACpB,QAAA,OAAO,GAAG;IACZ,CAAC,EAAE,EAAmB,CAAC;AACzB;AAgCA;;;AAGG;MACU,aAAa,GAAG,CAC3B,IAAiE,EACjE,KAAiC,KAC/B;IACF,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;;;IAIxB,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;IAC9B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;AAE/B,IAAA,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;;QAEd,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;AACtB,IAAA;AAED,IAAA,IAAI,EAAE;AACN,IAAA,IAAI,EAAE;AAEN,IAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;;QAEvC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC;AACP,QAAA;QACD,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE;QAClB,EAAE,GAAG,CAAC;AACP,IAAA;AAAM,SAAA;;QAEL,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC;AACP,QAAA;QACD,EAAE,GAAG,CAAC;QACN,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE;AACnB,IAAA;AAED,IAAA,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AACjC;AAEA;;;AAGG;AACI,MAAM,gBAAgB,GAAG,CAAC,CAAa,KAAI;IAChD,MAAM,aAAa,GAAW,EAAE;IAChC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;AAChC,QAAA,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;AACvB,IAAA;;IAGD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AAC/B,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK;QAC5B,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YAC7C,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAClC,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;AAChC,QAAA,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAM,EAAE,EAAM,KACtD,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CACjE;AACF,IAAA;AAED,IAAA,OAAO,aAAa;AACtB;AAEA;;;AAGG;AACI,MAAM,cAAc,GAAG,CAAC,CAAa,KAAI;IAC9C,MAAM,SAAS,GAAG;AACf,SAAA,WAAW;AACX,SAAA,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;AACvC,SAAA,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAClC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE;AACrD,YAAA,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG;AACpB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;AAEO,MAAM,gBAAgB,GAAG,CAAC,CAAa,EAAE,cAAA,GAAyB,CAAC,KAAI;;AAE5E,IAAA,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE;IAC7B,MAAM,SAAS,GAAG;AACf,SAAA,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;AACvC,SAAA,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;IAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACrC,MAAM,MAAM,GAAW,EAAE;AAEzB,IAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAClB,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,CAAC,IAAI,MAAM;AAEzC,QAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AACjB,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;AAClB,QAAA;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACzB,IAAA,CAAC,CAAC;IAEF,IAAI,KAAK,GAAG,CAAC;AACb,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACtC,QAAA,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,IAAI,EAAE,KAAK,SAAS,EAAE;AACpB,YAAA,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC;AACX,YAAA;AACF,QAAA;AAAM,aAAA,IAAI,KAAK,EAAE;YAChB,EAAE,KAAA,IAAA,IAAF,EAAE,KAAA,MAAA,GAAA,MAAA,GAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAK,KAAI;gBACpB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AACzB,gBAAA,IAAI,IAAI,EAAE;AACR,oBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;AACpC,oBAAA,IAAI,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK;AACzB,gBAAA;AACH,YAAA,CAAC,CAAC;AACH,QAAA;AACF,IAAA;AACH;AAEO,MAAMA,eAAa,GAAG,CAC3B,CAAa,EACb,MAAc,EACd,IAAa,EACb,KAAc,KACZ;AACF,IAAA,MAAM,IAAI,GAAa;AACrB,QAAA,KAAK,EAAE,CAAC;AACR,QAAA,MAAM,EAAE,CAAC;KACV;IACD,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACrC,QAAA,IAAI,CAAC,IAAI,GAAG,IAAI;AAChB,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK;AACnB,IAAA;IACD,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC;AAChD;AAEO,MAAM,OAAO,GAAG,CAAC,CAAa,KAAI;AACvC,IAAA,IAAI,OAAe;IACnB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK;QACzB,IAAI,IAAI,KAAK,SAAS,EAAE;AACtB,YAAA,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;gBAC3C,OAAO,GAAG,IAAI;AACf,YAAA;AACF,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,IAAI,CAAC,OAAQ,EAAE;QACb,OAAO,GAAG,CAAC;AACZ,IAAA;AACD,IAAA,OAAO,OAAO;AAChB;AAEA;;;;AAIG;MACU,SAAS,GAAG,CACvB,UAAe,EACf,EAAuB,KACrB;IACF,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,EAAS,EAAE,GAAG,EAAE,EAAS,EAAE;IACjD,UAAU,KAAA,IAAA,IAAV,UAAU,KAAA,MAAA,GAAA,MAAA,GAAV,UAAU,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;AAC5B,QAAA,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AACb,YAAA,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AACvB,QAAA;AAAM,aAAA;AACL,YAAA,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AACvB,QAAA;AACH,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;MAEa,KAAK,GAAG,CAAU,KAAU,EAAE,IAA0B,KAAI;IACvE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AAC3B,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;AACpB,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACpB,OAAO,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC;AAC5B,IAAA,CAAC,CAAC;AACJ;AAEA,MAAM,KAAK,GAAG,CACZ,KAAiB,EACjB,IAAyB,EACzB,SAAkB,EAClB,OAAa,EACb,SAAuD,EACvD,MAAY,KACV;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;AAC9B,QAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,SAAS,EAAE;AACd,YAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACrB,QAAA;QACD,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;AACpC,QAAA,IAAI,SAAS,EAAE;YACb,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,KAClB,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CACvD;AACF,QAAA;AACD,QAAA,IAAI,SAAS,EAAE;AACb,YAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACrB,QAAA;AACF,IAAA;AACH,CAAC;AAED;;;AAGG;AACI,MAAMC,KAAG,GAAG,CACjB,KAAiB,EACjB,IAAiD,EACjD,KAAqB,EACrB,UAAmB,KACjB;AACF,IAAA,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;IACjD,MAAM,SAAS,GAAG,CAAC,CAAK,KACgB,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAS,EAAE;IACxB,MAAM,OAAO,GAAS,EAAE;AACxB,IAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;AAC3B,YAAA,MAAM,IAAI,KAAK,CAAC,6BAA6B,IAAI,CAAA,CAAE,CAAC;AACrD,QAAA;AAAM,aAAA;AACL,YAAA,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC;AAClE,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,OAAO;AAChB;;;;"}

package/lib/algorithm/base-layout.d.ts

@@ -0,0 +1,48 @@
+import { GraphLib } from '../model/data.js';
+import { RuntimeContext } from '../runtime/context.js';
+import { Supervisor } from '../runtime/supervisor.js';
+import { GraphData, GraphNode, GraphEdge } from '../types/data.js';
+import { BaseLayoutOptions, Layout, LayoutWithIterations } from './types.js';
+import { Point } from '../types/point.js';
+
+/**
+ * <zh/> 布局基类
+ *
+ * <en/> Base class for layouts
+ */
+declare abstract class BaseLayout<O extends BaseLayoutOptions = BaseLayoutOptions> implements Layout<O> {
+    abstract readonly id: string;
+    protected abstract getDefaultOptions(): O;
+    protected initialOptions: O;
+    protected runtimeOptions: O;
+    protected context: RuntimeContext;
+    protected model: GraphLib;
+    protected supervisor: Supervisor | null;
+    constructor(options?: Partial<O>);
+    get options(): O;
+    execute(data: GraphData, userOptions?: Partial<O>): Promise<void>;
+    protected abstract layout(options: O): Promise<void>;
+    protected layoutInWorker(data: GraphData, options: O): Promise<void>;
+    forEachNode(callback: (node: GraphNode, index: number) => void): void;
+    forEachEdge(callback: (edge: GraphEdge, index: number) => void): void;
+    destroy(): void;
+}
+/**
+ * <zh/> 迭代布局基类
+ *
+ * <en/> Base class for iterative layouts
+ */
+declare abstract class BaseLayoutWithIterations<O extends BaseLayoutOptions = BaseLayoutOptions> extends BaseLayout<O> {
+    abstract stop(): void;
+    abstract tick(iterations: number): void;
+    abstract restart(): void;
+    abstract setFixedPosition(nodeId: string, position: Point | null): void;
+}
+/**
+ * <zh/> 判断布局是否为迭代布局
+ *
+ * <en/> Determine whether the layout is an iterative layout
+ */
+declare function isLayoutWithIterations(layout: any): layout is LayoutWithIterations;
+
+export { BaseLayout, BaseLayoutOptions, BaseLayoutWithIterations, isLayoutWithIterations };

package/lib/algorithm/base-layout.js

@@ -0,0 +1,87 @@
+import { __awaiter } from '../node_modules/tslib/tslib.es6.js';
+import { RuntimeContext } from '../runtime/context.js';
+import { Supervisor } from '../runtime/supervisor.js';
+import { mergeOptions } from '../util/object.js';
+
+/**
+ * <zh/> 布局基类
+ *
+ * <en/> Base class for layouts
+ */
+class BaseLayout {
+    constructor(options) {
+        this.supervisor = null;
+        this.initialOptions = mergeOptions(this.getDefaultOptions(), options);
+    }
+    get options() {
+        return this.runtimeOptions || this.initialOptions;
+    }
+    execute(data, userOptions) {
+        return __awaiter(this, void 0, void 0, function* () {
+            this.runtimeOptions = mergeOptions(this.initialOptions, userOptions);
+            const { node, edge, enableWorker } = this.runtimeOptions;
+            this.context = new RuntimeContext(data, { node, edge });
+            this.model = this.context.graph;
+            const shouldUseWorker = enableWorker && typeof Worker !== 'undefined';
+            if (shouldUseWorker) {
+                yield this.layoutInWorker(data, this.runtimeOptions);
+            }
+            else {
+                yield this.layout(this.runtimeOptions);
+            }
+        });
+    }
+    layoutInWorker(data, options) {
+        var _a;
+        return __awaiter(this, void 0, void 0, function* () {
+            try {
+                if (!this.supervisor) {
+                    this.supervisor = new Supervisor();
+                }
+                const result = yield this.supervisor.execute(this.id, data, options);
+                (_a = this.context) === null || _a === void 0 ? void 0 : _a.replace(result);
+            }
+            catch (error) {
+                console.error('Layout in worker failed, fallback to main thread layout.', error);
+                // Fallback to main thread layout
+                yield this.layout(options);
+            }
+        });
+    }
+    forEachNode(callback) {
+        this.context.forEachNode(callback);
+    }
+    forEachEdge(callback) {
+        this.context.forEachEdge(callback);
+    }
+    destroy() {
+        var _a;
+        (_a = this.context) === null || _a === void 0 ? void 0 : _a.destroy();
+        // @ts-ignore
+        this.model = null;
+        // @ts-ignore
+        this.context = null;
+        if (this.supervisor) {
+            this.supervisor.destroy();
+            this.supervisor = null;
+        }
+    }
+}
+/**
+ * <zh/> 迭代布局基类
+ *
+ * <en/> Base class for iterative layouts
+ */
+class BaseLayoutWithIterations extends BaseLayout {
+}
+/**
+ * <zh/> 判断布局是否为迭代布局
+ *
+ * <en/> Determine whether the layout is an iterative layout
+ */
+function isLayoutWithIterations(layout) {
+    return !!layout.tick && !!layout.stop;
+}
+
+export { BaseLayout, BaseLayoutWithIterations, isLayoutWithIterations };
+//# sourceMappingURL=base-layout.js.map

package/lib/algorithm/base-layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-layout.js","sources":["../../src/algorithm/src/algorithm/base-layout.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;AAaA;;;;AAIG;MACmB,UAAU,CAAA;AAkB9B,IAAA,WAAA,CAAY,OAAoB,EAAA;QAFtB,IAAA,CAAA,UAAU,GAAsB,IAAI;AAG5C,QAAA,IAAI,CAAC,cAAc,GAAG,YAAY,CAAI,IAAI,CAAC,iBAAiB,EAAE,EAAE,OAAO,CAAC;IAC1E;AAEA,IAAA,IAAI,OAAO,GAAA;AACT,QAAA,OAAO,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc;IACnD;IAEa,OAAO,CAClB,IAAe,EACf,WAAwB,EAAA;;YAExB,IAAI,CAAC,cAAc,GAAG,YAAY,CAAI,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC;YACvE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,cAAc;AAExD,YAAA,IAAI,CAAC,OAAO,GAAG,IAAI,cAAc,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YACvD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK;YAE/B,MAAM,eAAe,GAAG,YAAY,IAAI,OAAO,MAAM,KAAK,WAAW;AACrE,YAAA,IAAI,eAAe,EAAE;gBACnB,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC;AACrD,YAAA;AAAM,iBAAA;gBACL,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC;AACvC,YAAA;QACH,CAAC,CAAA;AAAA,IAAA;IAIe,cAAc,CAAC,IAAe,EAAE,OAAU,EAAA;;;YACxD,IAAI;AACF,gBAAA,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;AACpB,oBAAA,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,EAAE;AACnC,gBAAA;AAED,gBAAA,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC;gBACpE,CAAA,EAAA,GAAA,IAAI,CAAC,OAAO,MAAA,IAAA,IAAA,EAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAAE,OAAO,CAAC,MAAM,CAAC;AAC9B,YAAA;AAAC,YAAA,OAAO,KAAK,EAAE;AACd,gBAAA,OAAO,CAAC,KAAK,CACX,0DAA0D,EAC1D,KAAK,CACN;;AAGD,gBAAA,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;AAC3B,YAAA;;AACF,IAAA;AAEM,IAAA,WAAW,CAAC,QAAkD,EAAA;AACnE,QAAA,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC;IACpC;AAEO,IAAA,WAAW,CAAC,QAAkD,EAAA;AACnE,QAAA,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC;IACpC;IAEO,OAAO,GAAA;;AACZ,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,OAAO,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,EAAE;;AAEvB,QAAA,IAAI,CAAC,KAAK,GAAG,IAAI;;AAEjB,QAAA,IAAI,CAAC,OAAO,GAAG,IAAI;QAEnB,IAAI,IAAI,CAAC,UAAU,EAAE;AACnB,YAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE;AACzB,YAAA,IAAI,CAAC,UAAU,GAAG,IAAI;AACvB,QAAA;IACH;AACD;AAED;;;;AAIG;AACG,MAAgB,wBAEpB,SAAQ,UAAa,CAAA;AAQtB;AAED;;;;AAIG;AACG,SAAU,sBAAsB,CACpC,MAAW,EAAA;IAEX,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI;AACvC;;;;"}

package/lib/algorithm/base-simulation.d.ts

@@ -0,0 +1,20 @@
+import EventEmitter from '@antv/event-emitter';
+import { SimulationOptions } from './types.js';
+
+declare abstract class BaseSimulation<T extends SimulationOptions = SimulationOptions> extends EventEmitter {
+    protected iteration: number;
+    protected judgingDistance: number;
+    protected running: boolean;
+    protected options: T;
+    private tickCallback;
+    private endCallback;
+    private timer;
+    initialize(options: T): void;
+    on(event: 'tick' | 'end', cb: () => void): this;
+    tick(iterations?: number): this;
+    restart(): this;
+    stop(): this;
+    protected abstract runOneStep(): number;
+}
+
+export { BaseSimulation, SimulationOptions };

package/lib/algorithm/base-simulation.js

@@ -0,0 +1,75 @@
+import EventEmitter from '../node_modules/@antv/event-emitter/esm/index.js';
+
+class BaseSimulation extends EventEmitter {
+    constructor() {
+        super(...arguments);
+        this.iteration = 0;
+        this.judgingDistance = Infinity;
+        this.running = false;
+        this.tickCallback = null;
+        this.endCallback = null;
+        this.timer = 0;
+    }
+    initialize(options) {
+        this.options = options;
+        this.iteration = 0;
+        this.judgingDistance = Infinity;
+    }
+    on(event, cb) {
+        if (event === 'tick')
+            this.tickCallback = cb;
+        if (event === 'end')
+            this.endCallback = cb;
+        return this;
+    }
+    tick(iterations = 1) {
+        var _a;
+        for (let i = 0; i < iterations; i++) {
+            const distance = this.runOneStep();
+            this.judgingDistance = distance;
+            this.iteration++;
+            (_a = this.tickCallback) === null || _a === void 0 ? void 0 : _a.call(this);
+        }
+        return this;
+    }
+    restart() {
+        if (this.running)
+            return this;
+        const { maxIteration = 500, minMovement = 0, animate = true, } = this.options;
+        /** 非动画 or 非浏览器环境 */
+        if (!animate || typeof window === 'undefined') {
+            while (this.iteration < maxIteration &&
+                (this.judgingDistance > minMovement || this.iteration < 1)) {
+                this.tick(1);
+            }
+            Promise.resolve().then(() => {
+                var _a;
+                (_a = this.endCallback) === null || _a === void 0 ? void 0 : _a.call(this);
+            });
+            return this;
+        }
+        /** 动画模式 */
+        this.running = true;
+        this.timer = window.setInterval(() => {
+            var _a;
+            this.tick(1);
+            if (this.iteration >= maxIteration ||
+                this.judgingDistance < minMovement) {
+                this.stop();
+                (_a = this.endCallback) === null || _a === void 0 ? void 0 : _a.call(this);
+            }
+        }, 0);
+        return this;
+    }
+    stop() {
+        this.running = false;
+        if (this.timer) {
+            clearInterval(this.timer);
+            this.timer = 0;
+        }
+        return this;
+    }
+}
+
+export { BaseSimulation };
+//# sourceMappingURL=base-simulation.js.map

package/lib/algorithm/base-simulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-simulation.js","sources":["../../src/algorithm/src/algorithm/base-simulation.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAKM,MAAgB,cAEpB,SAAQ,YAAY,CAAA;AAFtB,IAAA,WAAA,GAAA;;QAGY,IAAA,CAAA,SAAS,GAAG,CAAC;QACb,IAAA,CAAA,eAAe,GAAG,QAAQ;QAC1B,IAAA,CAAA,OAAO,GAAG,KAAK;QAIjB,IAAA,CAAA,YAAY,GAAwB,IAAI;QACxC,IAAA,CAAA,WAAW,GAAwB,IAAI;QACvC,IAAA,CAAA,KAAK,GAAW,CAAC;IA6E3B;AA3EE,IAAA,UAAU,CAAC,OAAU,EAAA;AACnB,QAAA,IAAI,CAAC,OAAO,GAAG,OAAO;AAEtB,QAAA,IAAI,CAAC,SAAS,GAAG,CAAC;AAClB,QAAA,IAAI,CAAC,eAAe,GAAG,QAAQ;IACjC;IAEA,EAAE,CAAC,KAAqB,EAAE,EAAc,EAAA;QACtC,IAAI,KAAK,KAAK,MAAM;AAAE,YAAA,IAAI,CAAC,YAAY,GAAG,EAAE;QAC5C,IAAI,KAAK,KAAK,KAAK;AAAE,YAAA,IAAI,CAAC,WAAW,GAAG,EAAE;AAC1C,QAAA,OAAO,IAAI;IACb;IAEA,IAAI,CAAC,UAAU,GAAG,CAAC,EAAA;;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;AACnC,YAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE;AAClC,YAAA,IAAI,CAAC,eAAe,GAAG,QAAQ;YAC/B,IAAI,CAAC,SAAS,EAAE;AAChB,YAAA,CAAA,EAAA,GAAA,IAAI,CAAC,YAAY,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAA,IAAA,CAAA,IAAA,CAAI;AACtB,QAAA;AACD,QAAA,OAAO,IAAI;IACb;IAEA,OAAO,GAAA;QACL,IAAI,IAAI,CAAC,OAAO;AAAE,YAAA,OAAO,IAAI;AAE7B,QAAA,MAAM,EACJ,YAAY,GAAG,GAAG,EAClB,WAAW,GAAG,CAAC,EACf,OAAO,GAAG,IAAI,GACf,GAAG,IAAI,CAAC,OAAO;;AAGhB,QAAA,IAAI,CAAC,OAAO,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;AAC7C,YAAA,OACE,IAAI,CAAC,SAAS,GAAG,YAAY;AAC7B,iBAAC,IAAI,CAAC,eAAe,GAAG,WAAW,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAC1D;AACA,gBAAA,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACb,YAAA;AAED,YAAA,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAK;;AAC1B,gBAAA,CAAA,EAAA,GAAA,IAAI,CAAC,WAAW,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAA,IAAA,CAAA,IAAA,CAAI;AACtB,YAAA,CAAC,CAAC;AAEF,YAAA,OAAO,IAAI;AACZ,QAAA;;AAGD,QAAA,IAAI,CAAC,OAAO,GAAG,IAAI;QACnB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,MAAK;;AACnC,YAAA,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAEZ,YAAA,IACE,IAAI,CAAC,SAAS,IAAI,YAAY;AAC9B,gBAAA,IAAI,CAAC,eAAe,GAAG,WAAW,EAClC;gBACA,IAAI,CAAC,IAAI,EAAE;AACX,gBAAA,CAAA,EAAA,GAAA,IAAI,CAAC,WAAW,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAA,IAAA,CAAA,IAAA,CAAI;AACrB,YAAA;QACH,CAAC,EAAE,CAAC,CAAC;AAEL,QAAA,OAAO,IAAI;IACb;IAEA,IAAI,GAAA;AACF,QAAA,IAAI,CAAC,OAAO,GAAG,KAAK;QACpB,IAAI,IAAI,CAAC,KAAK,EAAE;AACd,YAAA,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC;AACzB,YAAA,IAAI,CAAC,KAAK,GAAG,CAAC;AACf,QAAA;AACD,QAAA,OAAO,IAAI;IACb;AAGD;;;;"}

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

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

package/lib/algorithm/circular/index.js

@@ -0,0 +1,108 @@
+import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';
+import { BaseLayout } from '../base-layout.js';
+import { applySingleNodeLayout } from '../../util/common.js';
+import { orderByTopology, orderByDegree } from '../../util/order.js';
+import { normalizeViewport } from '../../util/viewport.js';
+import { formatNodeSizeFn } from '../../util/format.js';
+import isNil from '../../node_modules/@antv/util/esm/lodash/is-nil.js';
+
+const DEFAULT_LAYOUT_OPTIONS = {
+    radius: null,
+    startRadius: null,
+    endRadius: null,
+    startAngle: 0,
+    endAngle: 2 * Math.PI,
+    clockwise: true,
+    divisions: 1,
+    ordering: null,
+    angleRatio: 1,
+    nodeSize: 10,
+};
+/**
+ * <zh/> 环形布局
+ *
+ * <en/> Circular layout
+ */
+class CircularLayout extends BaseLayout {
+    constructor() {
+        super(...arguments);
+        this.id = 'circular';
+    }
+    getDefaultOptions() {
+        return DEFAULT_LAYOUT_OPTIONS;
+    }
+    layout() {
+        return __awaiter(this, void 0, void 0, function* () {
+            const { width, height, center } = normalizeViewport(this.options);
+            const n = this.model.nodeCount();
+            if (!n || n === 1) {
+                applySingleNodeLayout(this.model, center);
+                return;
+            }
+            const { ordering, nodeSpacing, nodeSize, endAngle = 2 * Math.PI, startAngle = 0, divisions, angleRatio, clockwise, } = this.options;
+            // Order nodes based on strategy
+            if (ordering === 'topology') {
+                // layout according to the graph topology ignoring edge directions
+                orderByTopology(this.model, false);
+            }
+            else if (ordering === 'topology-directed') {
+                // layout according to the graph topology considering edge directions
+                orderByTopology(this.model, true);
+            }
+            else if (ordering === 'degree') {
+                // layout according to the descent order of degrees
+                orderByDegree(this.model);
+            }
+            let { radius, startRadius, endRadius } = this.options;
+            const nodes = this.model.nodes();
+            const format = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULT_LAYOUT_OPTIONS.nodeSize);
+            if (!isNil(nodeSpacing)) {
+                let perimeter = 0;
+                for (const node of nodes) {
+                    perimeter += format(node._original);
+                }
+                radius = perimeter / (2 * Math.PI);
+            }
+            else if (!radius && !startRadius && !endRadius) {
+                radius = Math.min(height, width) / 2;
+            }
+            else if (!startRadius && endRadius) {
+                startRadius = endRadius;
+            }
+            else if (startRadius && !endRadius) {
+                endRadius = startRadius;
+            }
+            // Calculate node positions
+            const angleStep = (endAngle - startAngle) / n;
+            const adjustedStep = angleStep * angleRatio;
+            const nodesPerDivision = Math.ceil(n / divisions);
+            const divAngle = (2 * Math.PI) / divisions;
+            for (let i = 0; i < n;) {
+                const node = nodes[i];
+                // Calculate radius for this node
+                let r = radius;
+                if (!r && startRadius !== null && endRadius !== null) {
+                    r = startRadius + (i * (endRadius - startRadius)) / (n - 1);
+                }
+                if (!r) {
+                    r = 10 + (i * 100) / (n - 1);
+                }
+                // Calculate angle for this node
+                const divisionIndex = Math.floor(i / nodesPerDivision);
+                const indexInDivision = i % nodesPerDivision;
+                const theta = indexInDivision * adjustedStep + divAngle * divisionIndex;
+                let angle = startAngle + theta;
+                if (!clockwise) {
+                    angle = endAngle - theta;
+                }
+                // Set position
+                node.x = center[0] + Math.cos(angle) * r;
+                node.y = center[1] + Math.sin(angle) * r;
+                i++;
+            }
+        });
+    }
+}
+
+export { CircularLayout };
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../src/algorithm/circular/src/algorithm/circular/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;AASA,MAAM,sBAAsB,GAA0B;AACpD,IAAA,MAAM,EAAE,IAAI;AACZ,IAAA,WAAW,EAAE,IAAI;AACjB,IAAA,SAAS,EAAE,IAAI;AACf,IAAA,UAAU,EAAE,CAAC;AACb,IAAA,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE;AACrB,IAAA,SAAS,EAAE,IAAI;AACf,IAAA,SAAS,EAAE,CAAC;AACZ,IAAA,QAAQ,EAAE,IAAI;AACd,IAAA,UAAU,EAAE,CAAC;AACb,IAAA,QAAQ,EAAE,EAAE;CACb;AAED;;;;AAIG;AACG,MAAO,cAAe,SAAQ,UAAiC,CAAA;AAArE,IAAA,WAAA,GAAA;;QACE,IAAA,CAAA,EAAE,GAAG,UAAU;IA8FjB;IA5FY,iBAAiB,GAAA;AACzB,QAAA,OAAO,sBAAsB;IAC/B;IAEgB,MAAM,GAAA;;AACpB,YAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC;YAEjE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;AAChC,YAAA,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACjB,gBAAA,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC;gBACzC;AACD,YAAA;AAED,YAAA,MAAM,EACJ,QAAQ,EACR,WAAW,EACX,QAAQ,EACR,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,EACtB,UAAU,GAAG,CAAC,EACd,SAAS,EACT,UAAU,EACV,SAAS,GACV,GAAG,IAAI,CAAC,OAAO;;YAGhB,IAAI,QAAQ,KAAK,UAAU,EAAE;;AAE3B,gBAAA,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;AACnC,YAAA;iBAAM,IAAI,QAAQ,KAAK,mBAAmB,EAAE;;AAE3C,gBAAA,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;AAClC,YAAA;iBAAM,IAAI,QAAQ,KAAK,QAAQ,EAAE;;AAEhC,gBAAA,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC;AAC1B,YAAA;YAED,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,OAAO;YAErD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;AAChC,YAAA,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,WAAW,EACX,sBAAsB,CAAC,QAAkB,CAC1C;AAED,YAAA,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE;gBACvB,IAAI,SAAS,GAAG,CAAC;AACjB,gBAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,oBAAA,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;AACpC,gBAAA;gBACD,MAAM,GAAG,SAAS,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AACnC,YAAA;iBAAM,IAAI,CAAC,MAAM,IAAI,CAAC,WAAW,IAAI,CAAC,SAAS,EAAE;gBAChD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC;AACrC,YAAA;AAAM,iBAAA,IAAI,CAAC,WAAW,IAAI,SAAS,EAAE;gBACpC,WAAW,GAAG,SAAS;AACxB,YAAA;AAAM,iBAAA,IAAI,WAAW,IAAI,CAAC,SAAS,EAAE;gBACpC,SAAS,GAAG,WAAW;AACxB,YAAA;;YAGD,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,UAAU,IAAI,CAAC;AAC7C,YAAA,MAAM,YAAY,GAAG,SAAS,GAAG,UAAW;YAC5C,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,SAAU,CAAC;YAClD,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,SAAU;YAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAI;AACvB,gBAAA,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;;gBAErB,IAAI,CAAC,GAAG,MAAM;gBACd,IAAI,CAAC,CAAC,IAAI,WAAW,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE;AACpD,oBAAA,CAAC,GAAG,WAAY,GAAG,CAAC,CAAC,IAAI,SAAU,GAAG,WAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAC/D,gBAAA;gBACD,IAAI,CAAC,CAAC,EAAE;AACN,oBAAA,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;AAC7B,gBAAA;;gBAGD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,gBAAgB,CAAC;AACtD,gBAAA,MAAM,eAAe,GAAG,CAAC,GAAG,gBAAgB;gBAC5C,MAAM,KAAK,GAAG,eAAe,GAAG,YAAY,GAAG,QAAQ,GAAG,aAAa;AACvE,gBAAA,IAAI,KAAK,GAAG,UAAU,GAAG,KAAK;gBAC9B,IAAI,CAAC,SAAS,EAAE;AACd,oBAAA,KAAK,GAAG,QAAQ,GAAG,KAAK;AACzB,gBAAA;;AAGD,gBAAA,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;AACxC,gBAAA,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;AAExC,gBAAA,CAAC,EAAE;AACJ,YAAA;QACH,CAAC,CAAA;AAAA,IAAA;AACF;;;;"}