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

package/lib/algorithm/force-atlas2/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../src/algorithm/force-atlas2/src/algorithm/force-atlas2/index.ts"],"sourcesContent":[null],"names":["DEFAULTS_LAYOUT_OPTIONS"],"mappings":";;;;;;;;AAcA,MAAMA,yBAAuB,GAAsC;AACjE,IAAA,QAAQ,EAAE,EAAE;AACZ,IAAA,WAAW,EAAE,CAAC;AACd,IAAA,KAAK,EAAE,GAAG;AACV,IAAA,MAAM,EAAE,GAAG;AACX,IAAA,EAAE,EAAE,CAAC;AACL,IAAA,EAAE,EAAE,CAAC;AACL,IAAA,IAAI,EAAE,QAAQ;AACd,IAAA,cAAc,EAAE,KAAK;AACrB,IAAA,YAAY,EAAE,KAAK;AACnB,IAAA,YAAY,EAAE,CAAC;AACf,IAAA,EAAE,EAAE,GAAG;AACP,IAAA,KAAK,EAAE,EAAE;AACT,IAAA,GAAG,EAAE,GAAG;CACT;AAIK,MAAO,iBAAkB,SAAQ,wBAAkD,CAAA;AAAzF,IAAA,WAAA,GAAA;;QACS,IAAA,CAAA,EAAE,GAAG,cAAc;QAEnB,IAAA,CAAA,UAAU,GAAsB,IAAI;IAyJ7C;IAvJY,iBAAiB,GAAA;AACzB,QAAA,OAAOA,yBAAuB;IAChC;AAEgB,IAAA,MAAM,CAAC,OAAiC,EAAA;;YACtD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;YACzC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM;YAE/C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;AAChC,YAAA,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACjB,OAAO,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC;AACjD,YAAA;YAED,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;AAE3C,YAAA,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC;AAEhE,YAAA,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE;YACvC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;AAClC,YAAA,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC;YAC7B,UAAU,CAAC,OAAO,EAAE;YAEpB,MAAM,GAAG,GAAG,MACV,IAAI,OAAO,CAAO,CAAC,OAAO,KAAI;AAC5B,gBAAA,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC;AAC/B,YAAA,CAAC,CAAC;AAEJ,YAAA,IAAI,CAAC,KAAK;gBAAE,OAAO,GAAG,EAAE;YAExB,MAAM,GAAG,EAAE;;AAGX,YAAA,IAAI,KAAK,EAAE;gBACT,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;AAChC,gBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;oBACxC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;oBACnC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;oBAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;oBAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAE;oBAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAE;oBAC3C,IAAI,YAAY,IAAI,CAAC,EAAE;AACrB,wBAAA,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;AAC3B,wBAAA,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;AAC5B,oBAAA;yBAAM,IAAI,YAAY,IAAI,CAAC,EAAE;AAC5B,wBAAA,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;AAC3B,wBAAA,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;AAC5B,oBAAA;AACF,gBAAA;AACD,gBAAA,UAAU,CAAC,UAAU,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAChB,MAAM,CAAA,EAAA,EACT,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,KAAK,IAChB;AACF,gBAAA,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC;AACrB,YAAA;QACH,CAAC,CAAA;AAAA,IAAA;IAEO,QAAQ,CACd,QAA+C,EAC/C,WAAqD,EAAA;QAErD,MAAM,MAAM,GAAY,EAAE;QAC1B,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;YAC9B,MAAM,UAAU,GAAG,gBAAgB,CAAC,QAAQ,EAAE,WAAW,CAAC;AAC1D,YAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;AAC9C,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,MAAM;IACf;IAEQ,aAAa,GAAA;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,UAAU,EAAE;AAEtD,QAAA,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YACpB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAK,EAAA,IAAA,EAAA,EAAA,EAAA,CAAA,CAC3C,OAAA,MAAA,CAAA,EAAA,GAAA,IAAI,CAAC,OAAO,EAAC,MAAM,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAA,IAAA,CAAA,EAAA,EAAG,IAAI,CAAC,CAAA,CAAA,CAAA,CAC5B;AACF,QAAA;QAED,OAAO,IAAI,CAAC,UAAU;IACxB;IAEQ,YAAY,CAClB,UAAoC,EAAE,EAAA;AAEtC,QAAA,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,GACrE,OAAO;QACT,MAAM,IAAI,GAAsC,EAAE;QAElD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;AAEhC,QAAA,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;AAAE,YAAA,IAAI,CAAC,SAAS,GAAG,IAAI;AAC7D,QAAA,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;AAAE,YAAA,IAAI,CAAC,KAAK,GAAG,IAAI;AAErD,QAAA,IAAI,YAAY,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE;AAChC,YAAA,IAAI,CAAC,YAAY,GAAG,GAAG;AACvB,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,YAAY,GAAG,IAAI;iBAC5C,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,YAAY,GAAG,IAAI;AAC3C,QAAA;AAAM,aAAA,IAAI,YAAY,KAAK,CAAC,IAAI,KAAK,EAAE;AACtC,YAAA,IAAI,CAAC,YAAY,GAAG,GAAG;AACvB,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,YAAY,GAAG,GAAG;iBAC3C,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,YAAY,GAAG,GAAG;AAC1C,QAAA;QAED,IAAI,CAAC,EAAE,EAAE;AACP,YAAA,IAAI,CAAC,EAAE,GAAG,EAAE;AACZ,YAAA,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG;AAAE,gBAAA,IAAI,CAAC,EAAE,GAAG,EAAE;iBAChC,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,EAAE,GAAG,CAAC;AAC9B,QAAA;QACD,IAAI,CAAC,EAAE,EAAE;AACP,YAAA,IAAI,CAAC,EAAE,GAAG,EAAE;AACZ,YAAA,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG;AAAE,gBAAA,IAAI,CAAC,EAAE,GAAG,EAAE;iBAChC,IAAI,CAAC,GAAG,GAAG;AAAE,gBAAA,IAAI,CAAC,EAAE,GAAG,CAAC;AAC9B,QAAA;AAED,QAAA,OAAO,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EACF,OAAO,CAAA,EACP,IAAI,GACJ,iBAAiB,CAAC,OAAO,CAAC,CAAA,EAAA,EAC7B,QAAQ,EAAE,YAAY,CACpB,QAAQ,EACRA,yBAAuB,CAAC,QAAkB,CAC3C,EACD,WAAW,EAAE,cAAc,CACzB,WAAW,EACXA,yBAAuB,CAAC,WAAqB,CAC9C,GACgC;IACrC;IAEO,IAAI,GAAA;;AACT,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,UAAU,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,EAAE;IACzB;IAEO,IAAI,CAAC,aAAqB,CAAC,EAAA;;QAChC,CAAA,EAAA,GAAA,IAAI,CAAC,UAAU,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,UAAU,CAAC;IACnC;IAEO,OAAO,GAAA;;AACZ,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,UAAU,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,EAAE;IAC5B;IAEO,gBAAgB,CAAC,EAAM,EAAE,QAAiC,EAAA;;QAC/D,CAAA,EAAA,GAAA,IAAI,CAAC,UAAU,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,gBAAgB,CAAC,EAAE,EAAE,QAAQ,CAAC;IACjD;IAEO,OAAO,GAAA;;QACZ,KAAK,CAAC,OAAO,EAAE;QACf,IAAI,CAAC,IAAI,EAAE;AACX,QAAA,CAAA,EAAA,GAAA,IAAI,CAAC,UAAU,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,EAAE;AAC1B,QAAA,IAAI,CAAC,UAAU,GAAG,IAAI;IACxB;AACD;;;;"}

package/lib/algorithm/force-atlas2/quad-tree.js

@@ -0,0 +1,106 @@
+/**
+ * @fileOverview quadTree
+ * @author shiwu.wyy@antfin.com
+ */
+class QuadTree {
+    // each quadtree represents a quadrant and an aggregate body
+    // that represents all bodies inside the quadrant
+    constructor(param) {
+        /**
+         * (aggregated) body in this quad
+         * @type  {object}
+         */
+        this.body = null;
+        /**
+         * tree representing the northwest quadrant
+         * @type  {object}
+         */
+        this.quad = null;
+        this.NW = null;
+        this.NE = null;
+        this.SW = null;
+        this.SE = null;
+        /**
+         * threshold
+         * @type  {number}
+         */
+        this.theta = 0.5;
+        if (param != null)
+            this.quad = param;
+    }
+    // insert a body(node) into the tree
+    insert(bo) {
+        // if this node does not contain a body, put the new body bo here
+        if (this.body == null) {
+            this.body = bo;
+            return;
+        }
+        // internal node
+        if (!this._isExternal()) {
+            // update mass info
+            this.body = this.body.add(bo);
+            // insert body into quadrant
+            this._putBody(bo);
+        }
+        else {
+            // external node
+            // divide this region into four children
+            if (this.quad) {
+                this.NW = new QuadTree(this.quad.NW());
+                this.NE = new QuadTree(this.quad.NE());
+                this.SW = new QuadTree(this.quad.SW());
+                this.SE = new QuadTree(this.quad.SE());
+            }
+            // insert this body and bo
+            this._putBody(this.body);
+            this._putBody(bo);
+            // update the mass info
+            this.body = this.body.add(bo);
+        }
+    }
+    // inserts bo into a quad
+    // tslint:disable-next-line
+    _putBody(bo) {
+        if (!this.quad)
+            return;
+        if (bo.in(this.quad.NW()) && this.NW)
+            this.NW.insert(bo);
+        else if (bo.in(this.quad.NE()) && this.NE)
+            this.NE.insert(bo);
+        else if (bo.in(this.quad.SW()) && this.SW)
+            this.SW.insert(bo);
+        else if (bo.in(this.quad.SE()) && this.SE)
+            this.SE.insert(bo);
+    }
+    // tslint:disable-next-line
+    _isExternal() {
+        // four children are null
+        return (this.NW == null && this.NE == null && this.SW == null && this.SE == null);
+    }
+    // update the forces
+    updateForce(bo) {
+        if (this.body == null || bo === this.body) {
+            return;
+        }
+        // if the current node is external
+        if (this._isExternal())
+            bo.addForce(this.body);
+        // internal nodes
+        else {
+            const s = this.quad ? this.quad.getLength() : 0;
+            const d = this.body.distanceTo(bo);
+            // b is far enough
+            if (s / d < this.theta)
+                bo.addForce(this.body);
+            else {
+                this.NW && this.NW.updateForce(bo);
+                this.NE && this.NE.updateForce(bo);
+                this.SW && this.SW.updateForce(bo);
+                this.SE && this.SE.updateForce(bo);
+            }
+        }
+    }
+}
+
+export { QuadTree as default };
+//# sourceMappingURL=quad-tree.js.map

package/lib/algorithm/force-atlas2/quad-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quad-tree.js","sources":["../../../src/algorithm/force-atlas2/src/algorithm/force-atlas2/quad-tree.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;;AAGG;AAEW,MAAO,QAAQ,CAAA;;;AAW3B,IAAA,WAAA,CAAY,KAAkB,EAAA;AAC5B;;;AAGG;AACH,QAAA,IAAI,CAAC,IAAI,GAAG,IAAI;AAChB;;;AAGG;AACH,QAAA,IAAI,CAAC,IAAI,GAAG,IAAI;AAChB,QAAA,IAAI,CAAC,EAAE,GAAG,IAAI;AACd,QAAA,IAAI,CAAC,EAAE,GAAG,IAAI;AACd,QAAA,IAAI,CAAC,EAAE,GAAG,IAAI;AACd,QAAA,IAAI,CAAC,EAAE,GAAG,IAAI;AACd;;;AAGG;AACH,QAAA,IAAI,CAAC,KAAK,GAAG,GAAG;QAChB,IAAI,KAAK,IAAI,IAAI;AAAE,YAAA,IAAI,CAAC,IAAI,GAAG,KAAK;IACtC;;AAEA,IAAA,MAAM,CAAC,EAAQ,EAAA;;AAEb,QAAA,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE;AACrB,YAAA,IAAI,CAAC,IAAI,GAAG,EAAE;YACd;AACD,QAAA;;AAED,QAAA,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE;;YAEvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;;AAE7B,YAAA,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;AAClB,QAAA;AAAM,aAAA;;;YAGL,IAAI,IAAI,CAAC,IAAI,EAAE;AACb,gBAAA,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;AACtC,gBAAA,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;AACtC,gBAAA,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;AACtC,gBAAA,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;AACvC,YAAA;;AAGD,YAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,YAAA,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;;YAEjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AAC9B,QAAA;IACH;;;AAGA,IAAA,QAAQ,CAAC,EAAQ,EAAA;QACf,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE;AAChB,QAAA,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE;AAAE,YAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AACnD,aAAA,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE;AAAE,YAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AACxD,aAAA,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE;AAAE,YAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AACxD,aAAA,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE;AAAE,YAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;IAC/D;;IAEA,WAAW,GAAA;;QAET,QACE,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI;IAE5E;;AAEA,IAAA,WAAW,CAAC,EAAQ,EAAA;QAClB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,EAAE;YACzC;AACD,QAAA;;QAED,IAAI,IAAI,CAAC,WAAW,EAAE;AAAE,YAAA,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;;AAEzC,aAAA;AACH,YAAA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC;YAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;;AAElC,YAAA,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK;AAAE,gBAAA,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACzC,iBAAA;gBACH,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;AACnC,YAAA;AACF,QAAA;IACH;AACD;;;;"}

package/lib/algorithm/force-atlas2/quad.js

@@ -0,0 +1,98 @@
+class Quad {
+    constructor(params) {
+        /**
+         * the center position of this quad
+         * @type  {number}
+         */
+        this.xmid = params.xmid;
+        /**
+         * the center position of this quad
+         * @type  {number}
+         */
+        this.ymid = params.ymid;
+        /**
+         * the length of this quad
+         * @type  {number}
+         */
+        this.length = params.length;
+        /**
+         * the mass center of this quad
+         * @type  {number}
+         */
+        this.massCenter = params.massCenter || [0, 0];
+        /**
+         * the mass of this quad
+         * @type  {number}
+         */
+        this.mass = params.mass || 1;
+    }
+    getLength() {
+        return this.length;
+    }
+    contains(x, y) {
+        const halfLen = this.length / 2;
+        return (x <= this.xmid + halfLen &&
+            x >= this.xmid - halfLen &&
+            y <= this.ymid + halfLen &&
+            y >= this.ymid - halfLen);
+    }
+    // northwest quadrant
+    // tslint:disable-next-line
+    NW() {
+        const x = this.xmid - this.length / 4;
+        const y = this.ymid + this.length / 4;
+        const len = this.length / 2;
+        const params = {
+            xmid: x,
+            ymid: y,
+            length: len,
+        };
+        const NW = new Quad(params);
+        return NW;
+    }
+    // northeast
+    // tslint:disable-next-line
+    NE() {
+        const x = this.xmid + this.length / 4;
+        const y = this.ymid + this.length / 4;
+        const len = this.length / 2;
+        const params = {
+            xmid: x,
+            ymid: y,
+            length: len,
+        };
+        const NE = new Quad(params);
+        return NE;
+    }
+    // southwest
+    // tslint:disable-next-line
+    SW() {
+        const x = this.xmid - this.length / 4;
+        const y = this.ymid - this.length / 4;
+        const len = this.length / 2;
+        const params = {
+            xmid: x,
+            ymid: y,
+            length: len,
+        };
+        const SW = new Quad(params);
+        return SW;
+    }
+    // southeast
+    // tslint:disable-next-line
+    SE() {
+        const x = this.xmid + this.length / 4;
+        const y = this.ymid - this.length / 4;
+        const len = this.length / 2;
+        const params = {
+            xmid: x,
+            ymid: y,
+            length: len,
+        };
+        const SE = new Quad(params);
+        return SE;
+    }
+}
+
+export { Quad as default };
+//# sourceMappingURL=quad.js.map

package/lib/algorithm/force-atlas2/quad.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quad.js","sources":["../../../src/algorithm/force-atlas2/src/algorithm/force-atlas2/quad.ts"],"sourcesContent":[null],"names":[],"mappings":"AAec,MAAO,IAAI,CAAA;AAMvB,IAAA,WAAA,CAAY,MAAiB,EAAA;AAC3B;;;AAGG;AACH,QAAA,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI;AACvB;;;AAGG;AACH,QAAA,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI;AACvB;;;AAGG;AACH,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;AAC3B;;;AAGG;AACH,QAAA,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;AAC7C;;;AAGG;QACH,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,CAAC;IAC9B;IACA,SAAS,GAAA;QACP,OAAO,IAAI,CAAC,MAAM;IACpB;IACA,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAA;AAC3B,QAAA,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AAC/B,QAAA,QACE,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;AACxB,YAAA,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;AACxB,YAAA,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;AACxB,YAAA,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;IAE5B;;;IAGA,EAAE,GAAA;QACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACrC,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AAC3B,QAAA,MAAM,MAAM,GAAc;AACxB,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,MAAM,EAAE,GAAG;SACZ;AACD,QAAA,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;AAC3B,QAAA,OAAO,EAAE;IACX;;;IAGA,EAAE,GAAA;QACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACrC,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AAC3B,QAAA,MAAM,MAAM,GAAG;AACb,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,MAAM,EAAE,GAAG;SACZ;AACD,QAAA,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;AAC3B,QAAA,OAAO,EAAE;IACX;;;IAGA,EAAE,GAAA;QACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACrC,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AAC3B,QAAA,MAAM,MAAM,GAAG;AACb,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,MAAM,EAAE,GAAG;SACZ;AACD,QAAA,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;AAC3B,QAAA,OAAO,EAAE;IACX;;;IAGA,EAAE,GAAA;QACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACrC,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AAC3B,QAAA,MAAM,MAAM,GAAG;AACb,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,IAAI,EAAE,CAAC;AACP,YAAA,MAAM,EAAE,GAAG;SACZ;AACD,QAAA,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;AAC3B,QAAA,OAAO,EAAE;IACX;AACD;;;;"}

package/lib/algorithm/force-atlas2/simulation.d.ts

@@ -0,0 +1,39 @@
+import { BaseSimulation } from '../base-simulation.js';
+import { ID } from '../../types/id.js';
+import { NullablePosition } from '../../types/position.js';
+import { GraphLib } from '../../model/data.js';
+import { ParsedForceAtlas2LayoutOptions, ForceAtlas2LayoutOptions } from './types.js';
+
+type SizeMap = Record<string, number>;
+/**
+ * ForceAtlas2 Simulation
+ */
+declare class Simulation extends BaseSimulation<ParsedForceAtlas2LayoutOptions> {
+    private sg;
+    private forces;
+    private preForces;
+    private bodies;
+    private sizes;
+    private maxIteration;
+    protected model: GraphLib;
+    data(model: GraphLib, sizes: SizeMap): this;
+    initialize(options: Required<ForceAtlas2LayoutOptions>): void;
+    private initForces;
+    /**
+     * Set a node's fixed position
+     */
+    setFixedPosition(id: ID, position: NullablePosition | null): void;
+    private isNodeFixed;
+    private syncFixedPositions;
+    /**
+     * Execute one step of the simulation
+     */
+    protected runOneStep(): number;
+    private calculateAttractive;
+    private calculateOptRepulsiveGravity;
+    private calculateRepulsiveGravity;
+    private updatePositions;
+    destroy(): void;
+}
+
+export { Simulation };

package/lib/algorithm/force-atlas2/simulation.js

@@ -0,0 +1,388 @@
+import { BaseSimulation } from '../base-simulation.js';
+import Body from './body.js';
+import Quad from './quad.js';
+import QuadTree from './quad-tree.js';
+import isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';
+
+/**
+ * ForceAtlas2 Simulation
+ */
+let Simulation$1 = class Simulation extends BaseSimulation {
+    constructor() {
+        super(...arguments);
+        this.sg = 0;
+        this.forces = {};
+        this.preForces = {};
+        this.bodies = {};
+        this.sizes = {};
+        this.maxIteration = 0;
+    }
+    data(model, sizes) {
+        this.model = model;
+        this.sizes = sizes;
+        return this;
+    }
+    initialize(options) {
+        super.initialize(options);
+        this.maxIteration = options.maxIteration;
+        this.sg = 0;
+        this.initForces();
+    }
+    initForces() {
+        const { model, options } = this;
+        const { kr, barnesHut } = options;
+        const nodes = model.nodes();
+        this.forces = {};
+        this.preForces = {};
+        this.bodies = {};
+        for (let i = 0; i < nodes.length; i += 1) {
+            const node = nodes[i];
+            this.forces[node.id] = [0, 0];
+            this.preForces[node.id] = [0, 0];
+            if (barnesHut) {
+                const params = {
+                    id: i,
+                    rx: node.x,
+                    ry: node.y,
+                    mass: 1,
+                    g: kr,
+                    degree: model.degree(node.id),
+                };
+                this.bodies[node.id] = new Body(params);
+            }
+        }
+    }
+    /**
+     * Set a node's fixed position
+     */
+    setFixedPosition(id, position) {
+        const node = this.model.node(id);
+        if (!node)
+            return;
+        const keys = ['fx', 'fy', 'fz'];
+        if (position === null) {
+            // Unset fixed position
+            keys.forEach((key) => {
+                delete node[key];
+            });
+            return;
+        }
+        position.forEach((value, index) => {
+            if (index < keys.length &&
+                (typeof value === 'number' || value === null)) {
+                node[keys[index]] = value;
+            }
+        });
+    }
+    isNodeFixed(node) {
+        return isNumber(node.fx) && isNumber(node.fy);
+    }
+    syncFixedPositions() {
+        this.model.forEachNode((node) => {
+            if (this.isNodeFixed(node)) {
+                node.x = node.fx;
+                node.y = node.fy;
+            }
+        });
+    }
+    /**
+     * Execute one step of the simulation
+     */
+    runOneStep() {
+        const { model, options } = this;
+        const { preventOverlap, barnesHut } = options;
+        const iter = this.maxIteration - this.iteration;
+        const krPrime = 100;
+        // Save previous & reset current force vectors
+        const nodes = model.nodes();
+        for (let i = 0; i < nodes.length; i += 1) {
+            const { id } = nodes[i];
+            this.preForces[id] = [...(this.forces[id] || [0, 0])];
+            this.forces[id] = [0, 0];
+        }
+        this.syncFixedPositions();
+        // 1. Attractive forces (edges)
+        this.calculateAttractive(iter);
+        // 2. Repulsive forces + gravity
+        // 当启用 Barnes-Hut 且不需要防重叠时使用优化算法
+        if (barnesHut && !preventOverlap) {
+            this.calculateOptRepulsiveGravity();
+        }
+        else {
+            this.calculateRepulsiveGravity(iter, krPrime);
+        }
+        // 3. Update positions
+        return this.updatePositions();
+    }
+    calculateAttractive(iter) {
+        const { model, options } = this;
+        const { preventOverlap, dissuadeHubs, mode, prune } = options;
+        const edges = model.edges();
+        for (let i = 0; i < edges.length; i += 1) {
+            const { source, target } = edges[i];
+            const sourceNode = model.node(source);
+            const targetNode = model.node(target);
+            const sourceDegree = model.degree(source);
+            const targetDegree = model.degree(target);
+            if (prune && (sourceDegree <= 1 || targetDegree <= 1))
+                continue;
+            const dirX = targetNode.x - sourceNode.x;
+            const dirY = targetNode.y - sourceNode.y;
+            let eucliDis = Math.hypot(dirX, dirY);
+            eucliDis = eucliDis < 1e-4 ? 1e-4 : eucliDis;
+            const nx = dirX / eucliDis;
+            const ny = dirY / eucliDis;
+            let effectiveDist = eucliDis;
+            // 当启用 preventOverlap 时,考虑节点大小,确保有效距离不为负
+            if (preventOverlap) {
+                effectiveDist = Math.max(0, eucliDis - this.sizes[source] - this.sizes[target]);
+            }
+            let faSource = effectiveDist;
+            let faTarget = effectiveDist;
+            if (mode === 'linlog') {
+                faSource = Math.log(1 + effectiveDist);
+                faTarget = faSource;
+            }
+            if (dissuadeHubs) {
+                faSource = effectiveDist / sourceDegree;
+                faTarget = effectiveDist / targetDegree;
+            }
+            this.forces[source][0] += faSource * nx;
+            this.forces[source][1] += faSource * ny;
+            this.forces[target][0] -= faTarget * nx;
+            this.forces[target][1] -= faTarget * ny;
+        }
+    }
+    calculateOptRepulsiveGravity() {
+        const { model, options } = this;
+        const { kg, center, prune, kr } = options;
+        const nodes = model.nodes();
+        const n = nodes.length;
+        // Compute bounding box and set body positions
+        let minx = Number.POSITIVE_INFINITY;
+        let maxx = Number.NEGATIVE_INFINITY;
+        let miny = Number.POSITIVE_INFINITY;
+        let maxy = Number.NEGATIVE_INFINITY;
+        for (let i = 0; i < n; i += 1) {
+            const node = nodes[i];
+            const { id, x, y } = node;
+            if (prune && model.degree(id) <= 1)
+                continue;
+            const body = this.bodies[id];
+            if (!body)
+                continue;
+            body.setPos(x, y);
+            if (x < minx)
+                minx = x;
+            if (x > maxx)
+                maxx = x;
+            if (y < miny)
+                miny = y;
+            if (y > maxy)
+                maxy = y;
+        }
+        let width = Math.max(maxx - minx, maxy - miny);
+        if (!isFinite(width) || width <= 0)
+            width = 1;
+        const quadParams = {
+            xmid: (maxx + minx) / 2,
+            ymid: (maxy + miny) / 2,
+            length: width,
+            massCenter: center,
+            mass: n,
+        };
+        const quad = new Quad(quadParams);
+        const quadTree = new QuadTree(quad);
+        // Insert bodies into tree
+        for (let i = 0; i < n; i += 1) {
+            const { id } = nodes[i];
+            if (prune && model.degree(id) <= 1)
+                continue;
+            const body = this.bodies[id];
+            if (body && body.in(quad))
+                quadTree.insert(body);
+        }
+        // Compute forces
+        for (let i = 0; i < n; i += 1) {
+            const node = nodes[i];
+            const { id, x, y } = node;
+            const degree = model.degree(id);
+            if (prune && degree <= 1)
+                continue;
+            const body = this.bodies[id];
+            if (!body)
+                continue;
+            body.resetForce();
+            quadTree.updateForce(body);
+            this.forces[id][0] -= body.fx;
+            this.forces[id][1] -= body.fy;
+            // Gravity toward center
+            const dx = x - center[0];
+            const dy = y - center[1];
+            let dist = Math.hypot(dx, dy);
+            dist = dist < 1e-4 ? 1e-4 : dist;
+            const nx = dx / dist;
+            const ny = dy / dist;
+            const fg = kg * (degree + 1);
+            this.forces[id][0] -= fg * nx;
+            this.forces[id][1] -= fg * ny;
+        }
+    }
+    calculateRepulsiveGravity(iter, krPrime) {
+        const { model, options } = this;
+        const { preventOverlap, kr, kg, center, prune } = options;
+        const nodes = model.nodes();
+        const n = nodes.length;
+        for (let i = 0; i < n; i += 1) {
+            const nodei = nodes[i];
+            const degreei = model.degree(nodei.id);
+            for (let j = i + 1; j < n; j += 1) {
+                const nodej = nodes[j];
+                const degreej = model.degree(nodej.id);
+                if (prune && (degreei <= 1 || degreej <= 1))
+                    continue;
+                const dx = nodej.x - nodei.x;
+                const dy = nodej.y - nodei.y;
+                let dist = Math.hypot(dx, dy);
+                dist = dist < 1e-4 ? 1e-4 : dist;
+                const nx = dx / dist;
+                const ny = dy / dist;
+                let effDist = dist;
+                let fr;
+                // 当启用 preventOverlap 时,考虑节点大小
+                if (preventOverlap) {
+                    const overlap = dist - this.sizes[nodei.id] - this.sizes[nodej.id];
+                    if (overlap < 0) {
+                        // 节点重叠,使用强推力
+                        fr = krPrime * (degreei + 1) * (degreej + 1);
+                    }
+                    else if (overlap === 0) {
+                        // 节点刚好接触,无斥力
+                        fr = 0;
+                    }
+                    else {
+                        // 节点未重叠,使用正常斥力
+                        effDist = overlap;
+                        fr = (kr * (degreei + 1) * (degreej + 1)) / effDist;
+                    }
+                }
+                else {
+                    fr = (kr * (degreei + 1) * (degreej + 1)) / effDist;
+                }
+                this.forces[nodei.id][0] -= fr * nx;
+                this.forces[nodei.id][1] -= fr * ny;
+                this.forces[nodej.id][0] += fr * nx;
+                this.forces[nodej.id][1] += fr * ny;
+            }
+            // Gravity toward center
+            const gx = nodei.x - center[0];
+            const gy = nodei.y - center[1];
+            let gdist = Math.hypot(gx, gy);
+            gdist = gdist < 1e-4 ? 1e-4 : gdist;
+            const gnx = gx / gdist;
+            const gny = gy / gdist;
+            const fg = kg * (degreei + 1);
+            this.forces[nodei.id][0] -= fg * gnx;
+            this.forces[nodei.id][1] -= fg * gny;
+        }
+    }
+    updatePositions() {
+        const { model, options } = this;
+        const { ks, tao, prune, ksmax, distanceThresholdMode = 'max' } = options;
+        const nodes = model.nodes();
+        const n = nodes.length;
+        const swgns = {};
+        const trans = {};
+        let swgG = 0;
+        let traG = 0;
+        // -------- ① 计算 swg / tra --------
+        for (let i = 0; i < n; i += 1) {
+            const { id } = nodes[i];
+            const degree = model.degree(id);
+            if (prune && degree <= 1)
+                continue;
+            const prev = this.preForces[id] || [0, 0];
+            const cur = this.forces[id] || [0, 0];
+            const minusX = cur[0] - prev[0];
+            const minusY = cur[1] - prev[1];
+            const minusNorm = Math.hypot(minusX, minusY);
+            const addX = cur[0] + prev[0];
+            const addY = cur[1] + prev[1];
+            const addNorm = Math.hypot(addX, addY);
+            swgns[id] = minusNorm;
+            trans[id] = addNorm / 2;
+            swgG += (degree + 1) * swgns[id];
+            traG += (degree + 1) * trans[id];
+        }
+        // -------- ② 更新 sg --------
+        let usingSg = this.sg;
+        const preSG = this.sg;
+        if (swgG <= 0) {
+            usingSg = preSG > 0 ? preSG : 1;
+        }
+        else {
+            usingSg = (tao * traG) / swgG;
+            if (preSG !== 0) {
+                usingSg = usingSg > 1.5 * preSG ? 1.5 * preSG : usingSg;
+            }
+        }
+        this.sg = usingSg;
+        // -------- ③ 新增：distance 累计 --------
+        let maxDistance = 0;
+        let minDistance = Infinity;
+        let sumDistance = 0;
+        let movedCount = 0;
+        // -------- ④ 更新位置 --------
+        for (let i = 0; i < n; i += 1) {
+            const node = nodes[i];
+            const id = node.id;
+            const degree = model.degree(id);
+            if (prune && degree <= 1)
+                continue;
+            if (this.isNodeFixed(node))
+                continue;
+            const swgVal = swgns[id] || 0;
+            let sn = (ks * usingSg) / (1 + usingSg * Math.sqrt(swgVal));
+            let absForce = Math.hypot(this.forces[id][0], this.forces[id][1]);
+            absForce = absForce < 1e-4 ? 1e-4 : absForce;
+            const maxStep = ksmax / absForce;
+            if (sn > maxStep)
+                sn = maxStep;
+            const dx = sn * this.forces[id][0];
+            const dy = sn * this.forces[id][1];
+            node.x += dx;
+            node.y += dy;
+            // -------- ⑤ 记录位移 --------
+            const dist = Math.hypot(dx, dy);
+            if (dist > 0) {
+                movedCount++;
+                sumDistance += dist;
+                if (dist > maxDistance)
+                    maxDistance = dist;
+                if (dist < minDistance)
+                    minDistance = dist;
+            }
+        }
+        // -------- ⑥ 根据 mode 返回 distance --------
+        switch (distanceThresholdMode) {
+            case 'min':
+                return minDistance;
+            case 'mean':
+                return movedCount > 0 ? sumDistance / movedCount : 0;
+            case 'max':
+            default:
+                return maxDistance;
+        }
+    }
+    destroy() {
+        this.stop();
+        this.forces = {};
+        this.preForces = {};
+        this.bodies = {};
+        this.sizes = {};
+        this.off();
+    }
+};
+
+export { Simulation$1 as Simulation };
+//# sourceMappingURL=simulation.js.map