@antv/layout 0.1.19-beta.4 → 0.1.21

package/lib/layout/dagre/src/debug.js

@@ -0,0 +1,31 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = __importDefault(require("./util"));
+var graphlib_1 = __importDefault(require("./graphlib"));
+var Graph = graphlib_1.default.Graph;
+/* istanbul ignore next */
+var debugOrdering = function (g) {
+    var layerMatrix = util_1.default.buildLayerMatrix(g);
+    var h = new Graph({ compound: true, multigraph: true }).setGraph({});
+    g.nodes().forEach(function (v) {
+        h.setNode(v, { label: v });
+        h.setParent(v, "layer" + g.node(v).rank);
+    });
+    g.edges().forEach(function (e) {
+        h.setEdge(e.v, e.w, {}, e.name);
+    });
+    layerMatrix.forEach(function (layer, i) {
+        var layerV = "layer" + i;
+        h.setNode(layerV, { rank: "same" });
+        layer === null || layer === void 0 ? void 0 : layer.reduce(function (u, v) {
+            h.setEdge(u, v, { style: "invis" });
+            return v;
+        });
+    });
+    return h;
+};
+exports.default = debugOrdering;
+//# sourceMappingURL=debug.js.map

package/lib/layout/dagre/src/debug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/debug.ts"],"names":[],"mappings":";;;;;AAAA,gDAA0B;AAC1B,wDAAkC;AAIlC,IAAM,KAAK,GAAI,kBAAgB,CAAC,KAAK,CAAC;AAEtC,0BAA0B;AAC1B,IAAM,aAAa,GAAG,UAAC,CAAS;IAC9B,IAAM,WAAW,GAAG,cAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAE7C,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAEvE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,UAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAM,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,WAAW,CAAC,OAAO,CAAC,UAAC,KAAU,EAAE,CAAS;QACxC,IAAM,MAAM,GAAG,UAAQ,CAAG,CAAC;QAC3B,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACpC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAC,UAAC,CAAS,EAAE,CAAS;YACjC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACpC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,kBAAe,aAAa,CAAC"}

package/lib/layout/dagre/src/graphlib.d.ts

@@ -0,0 +1,2 @@
+declare let graphlib: any;
+export default graphlib;

package/lib/layout/dagre/src/graphlib.js

@@ -0,0 +1,13 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+// @ts-ignore
+var graphlib_1 = __importDefault(require("@dagrejs/graphlib"));
+var graphlib = graphlib_1.default;
+if (!graphlib && typeof window !== "undefined") {
+    graphlib = window.graphlib;
+}
+exports.default = graphlib;
+//# sourceMappingURL=graphlib.js.map

package/lib/layout/dagre/src/graphlib.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphlib.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/graphlib.ts"],"names":[],"mappings":";;;;;AAAA,aAAa;AACb,+DAAqC;AAErC,IAAI,QAAQ,GAAG,kBAAI,CAAC;AAGpB,IAAI,CAAC,QAAQ,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IAC9C,QAAQ,GAAI,MAAc,CAAC,QAAQ,CAAC;CACrC;AAED,kBAAe,QAAQ,CAAC"}

package/lib/layout/dagre/src/greedy-fas.d.ts

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from '../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const greedyFAS: (g: IGraph, weightFn: () => unknown) => (import("../graphlib").Edge | undefined)[];
+export default greedyFAS;

package/lib/layout/dagre/src/greedy-fas.js

@@ -0,0 +1,118 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var graphlib_1 = __importDefault(require("./graphlib"));
+var list_1 = __importDefault(require("./data/list"));
+var Graph = graphlib_1.default.Graph;
+/*
+ * A greedy heuristic for finding a feedback arc set for a graph. A feedback
+ * arc set is a set of edges that can be removed to make a graph acyclic.
+ * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
+ * effective heuristic for the feedback arc set problem." This implementation
+ * adjusts that from the paper to allow for weighted edges.
+ */
+// module.exports = greedyFAS;
+var DEFAULT_WEIGHT_FN = function () { return 1; };
+var greedyFAS = function (g, weightFn) {
+    var _a;
+    if (g.nodeCount() <= 1)
+        return [];
+    var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+    var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
+    // Expand multi-edges
+    // @ts-ignore
+    return (_a = results.map(function (e) { return g.outEdges(e.v, e.w); })) === null || _a === void 0 ? void 0 : _a.flat();
+};
+var doGreedyFAS = function (g, buckets, zeroIdx) {
+    var results = [];
+    var sources = buckets[buckets.length - 1];
+    var sinks = buckets[0];
+    var entry;
+    while (g.nodeCount()) {
+        while ((entry = sinks.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        while ((entry = sources.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        if (g.nodeCount()) {
+            for (var i = buckets.length - 2; i > 0; --i) {
+                entry = buckets[i].dequeue();
+                if (entry) {
+                    results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+                    break;
+                }
+            }
+        }
+    }
+    return results;
+};
+var removeNode = function (g, buckets, zeroIdx, entry, collectPredecessors) {
+    var _a, _b;
+    var results = collectPredecessors ? [] : undefined;
+    (_a = g.inEdges(entry.v)) === null || _a === void 0 ? void 0 : _a.forEach(function (edge) {
+        var weight = g.edge(edge);
+        var uEntry = g.node(edge.v);
+        if (collectPredecessors) {
+            results.push({ v: edge.v, w: edge.w });
+        }
+        if (uEntry.out === undefined)
+            uEntry.out = 0;
+        uEntry.out -= weight;
+        assignBucket(buckets, zeroIdx, uEntry);
+    });
+    (_b = g.outEdges(entry.v)) === null || _b === void 0 ? void 0 : _b.forEach(function (edge) {
+        var weight = g.edge(edge);
+        var w = edge.w;
+        var wEntry = g.node(w);
+        if (wEntry.in === undefined)
+            wEntry.in = 0;
+        wEntry.in -= weight;
+        assignBucket(buckets, zeroIdx, wEntry);
+    });
+    g.removeNode(entry.v);
+    return results;
+};
+var buildState = function (g, weightFn) {
+    var fasGraph = new Graph();
+    var maxIn = 0;
+    var maxOut = 0;
+    g.nodes().forEach(function (v) {
+        fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
+    });
+    // Aggregate weights on nodes, but also sum the weights across multi-edges
+    // into a single edge for the fasGraph.
+    g.edges().forEach(function (e) {
+        var prevWeight = fasGraph.edge(e.v, e.w) || 0;
+        var weight = weightFn === null || weightFn === void 0 ? void 0 : weightFn(e);
+        var edgeWeight = prevWeight + weight;
+        fasGraph.setEdge(e.v, e.w, edgeWeight);
+        maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
+        maxIn = Math.max(maxIn, fasGraph.node(e.w)["in"] += weight);
+    });
+    var buckets = [];
+    var rangeMax = maxOut + maxIn + 3;
+    for (var i = 0; i < rangeMax; i++) {
+        buckets.push(new list_1.default());
+    }
+    var zeroIdx = maxIn + 1;
+    fasGraph.nodes().forEach(function (v) {
+        assignBucket(buckets, zeroIdx, fasGraph.node(v));
+    });
+    return { buckets: buckets, zeroIdx: zeroIdx, graph: fasGraph };
+};
+var assignBucket = function (buckets, zeroIdx, entry) {
+    if (!entry.out) {
+        buckets[0].enqueue(entry);
+    }
+    else if (!entry["in"]) {
+        buckets[buckets.length - 1].enqueue(entry);
+    }
+    else {
+        buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
+    }
+};
+exports.default = greedyFAS;
+//# sourceMappingURL=greedy-fas.js.map

package/lib/layout/dagre/src/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/greedy-fas.ts"],"names":[],"mappings":";;;;;AAAA,wDAAkC;AAClC,qDAA+B;AAI/B,IAAM,KAAK,GAAI,kBAAgB,CAAC,KAAK,CAAC;AAGtC;;;;;;GAMG;AACH,8BAA8B;AAE9B,IAAM,iBAAiB,GAAG,cAAM,OAAA,CAAC,EAAD,CAAC,CAAC;AAElC,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,QAAuB;;IACnD,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAC3D,IAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAY,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAE9E,qBAAqB;IACrB,aAAa;IACb,OAAO,MAAA,OAAO,CAAC,GAAG,CAAC,UAAC,CAAM,IAAK,OAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAApB,CAAoB,CAAC,0CAAE,IAAI,EAAE,CAAC;AAC/D,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,CAAS,EAAE,OAAY,EAAE,OAAe;IAC3D,IAAI,OAAO,GAAW,EAAE,CAAC;IACzB,IAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;QACpB,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAI;YAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SAAE;QAC/E,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SAAE;QAC/E,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE;YACjB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,EAAE;oBACT,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACvE,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,OAAY,EAAE,OAAe,EAAE,KAAU,EAAE,mBAA6B;;IACrG,IAAM,OAAO,GAAQ,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAE1D,MAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,IAAI;QAC/B,IAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAM,MAAM,GAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,mBAAmB,EAAE;YACvB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;SACxC;QACD,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC;QACrB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,MAAA,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,IAAI;QAChC,IAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS;YAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC;QACpB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEtB,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,QAAkC;IAC/D,IAAM,QAAQ,GAAG,IAAI,KAAK,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,GAAA,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,uCAAuC;IACvC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,IAAM,MAAM,GAAG,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,CAAC;QAC7B,IAAM,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;QACvC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACvC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC;QAC5D,KAAK,GAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,MAAM,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,IAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAG,EAAE;QAClC,OAAO,CAAC,IAAI,CAAC,IAAI,cAAI,EAAE,CAAC,CAAC;KAC1B;IACD,IAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;IAE1B,QAAQ,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QACjC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,SAAA,EAAE,OAAO,SAAA,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,OAAY,EAAE,OAAe,EAAE,KAAU;IAC7D,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;QACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3B;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;QACvB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC5C;SAAM;QACL,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3D;AACH,CAAC,CAAC;AAGF,kBAAe,SAAS,CAAC"}

package/lib/layout/dagre/src/layout.d.ts

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from '../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const layout: (g: IGraph, opts: any) => void;
+export default layout;

package/lib/layout/dagre/src/layout.js

@@ -0,0 +1,459 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var acyclic_1 = __importDefault(require("./acyclic"));
+var normalize_1 = __importDefault(require("./normalize"));
+var rank_1 = __importDefault(require("./rank"));
+var util_1 = __importStar(require("./util"));
+var parent_dummy_chains_1 = __importDefault(require("./parent-dummy-chains"));
+var nesting_graph_1 = __importDefault(require("./nesting-graph"));
+var add_border_segments_1 = __importDefault(require("./add-border-segments"));
+var coordinate_system_1 = __importDefault(require("./coordinate-system"));
+var order_1 = __importDefault(require("./order"));
+var position_1 = __importDefault(require("./position"));
+var graphlib_1 = __importDefault(require("./graphlib"));
+var init_data_order_1 = __importDefault(require("./order/init-data-order"));
+var Graph = graphlib_1.default.Graph;
+var layout = function (g, opts) {
+    var time = opts && opts.debugTiming ? util_1.default.time : util_1.default.notime;
+    time("layout", function () {
+        // 如果在原图基础上修改，继承原图的order结果
+        if (opts && !opts.keepNodeOrder && opts.prevGraph) {
+            time("  inheritOrder", function () { inheritOrder(g, opts.prevGraph); });
+        }
+        var layoutGraph = time("  buildLayoutGraph", function () { return buildLayoutGraph(g); });
+        // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）
+        if (!(opts && (opts.edgeLabelSpace === false))) {
+            time("  makeSpaceForEdgeLabels", function () { makeSpaceForEdgeLabels(layoutGraph); });
+        }
+        // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级
+        try {
+            time("  runLayout", function () { runLayout(layoutGraph, time, opts); });
+        }
+        catch (e) {
+            if (e.message === "Not possible to find intersection inside of the rectangle") {
+                console.error('The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph\'s structure:\n', e);
+                return;
+            }
+            throw (e);
+        }
+        time("  updateInputGraph", function () { updateInputGraph(g, layoutGraph); });
+    });
+};
+var runLayout = function (g, time, opts) {
+    time("    removeSelfEdges", function () { removeSelfEdges(g); });
+    time("    acyclic", function () { acyclic_1.default.run(g); });
+    time("    nestingGraph.run", function () { nesting_graph_1.default.run(g); });
+    time("    rank", function () { (0, rank_1.default)(util_1.default.asNonCompoundGraph(g)); });
+    time("    injectEdgeLabelProxies", function () { injectEdgeLabelProxies(g); });
+    time("    removeEmptyRanks", function () { (0, util_1.removeEmptyRanks)(g); });
+    time("    nestingGraph.cleanup", function () { nesting_graph_1.default.cleanup(g); });
+    time("    normalizeRanks", function () { (0, util_1.normalizeRanks)(g); });
+    time("    assignRankMinMax", function () { assignRankMinMax(g); });
+    time("    removeEdgeLabelProxies", function () { removeEdgeLabelProxies(g); });
+    time("    normalize.run", function () { normalize_1.default.run(g); });
+    time("    parentDummyChains", function () { (0, parent_dummy_chains_1.default)(g); });
+    time("    addBorderSegments", function () { (0, add_border_segments_1.default)(g); });
+    if (opts && opts.keepNodeOrder) {
+        time("    initDataOrder", function () { (0, init_data_order_1.default)(g, opts.nodeOrder); });
+    }
+    time("    order", function () { (0, order_1.default)(g); });
+    time("    insertSelfEdges", function () { insertSelfEdges(g); });
+    time("    adjustCoordinateSystem", function () { coordinate_system_1.default.adjust(g); });
+    time("    position", function () { (0, position_1.default)(g); });
+    time("    positionSelfEdges", function () { positionSelfEdges(g); });
+    time("    removeBorderNodes", function () { removeBorderNodes(g); });
+    time("    normalize.undo", function () { normalize_1.default.undo(g); });
+    time("    fixupEdgeLabelCoords", function () { fixupEdgeLabelCoords(g); });
+    time("    undoCoordinateSystem", function () { coordinate_system_1.default.undo(g); });
+    time("    translateGraph", function () { translateGraph(g); });
+    time("    assignNodeIntersects", function () { assignNodeIntersects(g); });
+    time("    reversePoints", function () { reversePointsForReversedEdges(g); });
+    time("    acyclic.undo", function () { acyclic_1.default.undo(g); });
+};
+/**
+ * 继承上一个布局中的order，防止翻转
+ * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变
+ */
+var inheritOrder = function (currG, prevG) {
+    var prevNodeMap = prevG._nodes || {};
+    currG.nodes().forEach(function (n) {
+        var node = currG.node(n);
+        if (prevNodeMap[n] !== undefined) {
+            node.fixorder = prevNodeMap[n]._order;
+            delete prevNodeMap[n]._order;
+        }
+        else {
+            delete node.fixorder;
+        }
+    });
+};
+/*
+ * Copies final layout information from the layout graph back to the input
+ * graph. This process only copies whitelisted attributes from the layout graph
+ * to the input graph, so it serves as a good place to determine what
+ * attributes can influence layout.
+ */
+var updateInputGraph = function (inputGraph, layoutGraph) {
+    inputGraph.nodes().forEach(function (v) {
+        var _a;
+        var inputLabel = inputGraph.node(v);
+        var layoutLabel = layoutGraph.node(v);
+        if (inputLabel) {
+            inputLabel.x = layoutLabel.x;
+            inputLabel.y = layoutLabel.y;
+            inputLabel._order = layoutLabel.order;
+            inputLabel._rank = layoutLabel.rank;
+            if ((_a = layoutGraph.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
+                inputLabel.width = layoutLabel.width;
+                inputLabel.height = layoutLabel.height;
+            }
+        }
+    });
+    inputGraph.edges().forEach(function (e) {
+        var inputLabel = inputGraph.edge(e);
+        var layoutLabel = layoutGraph.edge(e);
+        inputLabel.points = layoutLabel.points;
+        if (layoutLabel.hasOwnProperty("x")) {
+            inputLabel.x = layoutLabel.x;
+            inputLabel.y = layoutLabel.y;
+        }
+    });
+    inputGraph.graph().width = layoutGraph.graph().width;
+    inputGraph.graph().height = layoutGraph.graph().height;
+};
+var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
+var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
+var nodeNumAttrs = ["width", "height", "layer", "fixorder"]; // 需要传入layer, fixOrder作为参数参考
+var nodeDefaults = { width: 0, height: 0 };
+var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
+var edgeDefaults = {
+    minlen: 1, weight: 1, width: 0, height: 0,
+    labeloffset: 10, labelpos: "r"
+};
+var edgeAttrs = ["labelpos"];
+/*
+ * Constructs a new graph from the input graph, which can be used for layout.
+ * This process copies only whitelisted attributes from the input graph to the
+ * layout graph. Thus this function serves as a good place to determine what
+ * attributes can influence layout.
+ */
+var buildLayoutGraph = function (inputGraph) {
+    var g = new Graph({ multigraph: true, compound: true });
+    var graph = canonicalize(inputGraph.graph());
+    var pickedProperties = {};
+    graphAttrs.forEach(function (key) {
+        if (graph[key] !== undefined)
+            pickedProperties[key] = graph[key];
+    });
+    g.setGraph(Object.assign({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), pickedProperties));
+    inputGraph.nodes().forEach(function (v) {
+        var node = canonicalize(inputGraph.node(v));
+        var defaultAttrs = selectNumberAttrs(node, nodeNumAttrs);
+        Object.keys(nodeDefaults).forEach(function (key) {
+            if (defaultAttrs[key] === undefined) {
+                defaultAttrs[key] = nodeDefaults[key];
+            }
+        });
+        g.setNode(v, defaultAttrs);
+        g.setParent(v, inputGraph.parent(v));
+    });
+    inputGraph.edges().forEach(function (e) {
+        var edge = canonicalize(inputGraph.edge(e));
+        var pickedProperties = {};
+        edgeAttrs.forEach(function (key) {
+            if (edge[key] !== undefined)
+                pickedProperties[key] = edge[key];
+        });
+        g.setEdge(e, Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties));
+    });
+    return g;
+};
+/*
+ * This idea comes from the Gansner paper: to account for edge labels in our
+ * layout we split each rank in half by doubling minlen and halving ranksep.
+ * Then we can place labels at these mid-points between nodes.
+ *
+ * We also add some minimal padding to the width to push the label for the edge
+ * away from the edge itself a bit.
+ */
+var makeSpaceForEdgeLabels = function (g) {
+    var graph = g.graph();
+    if (!graph.ranksep)
+        graph.ranksep = 0;
+    graph.ranksep /= 2;
+    g.nodes().forEach(function (n) {
+        var node = g.node(n);
+        if (!isNaN(node.layer)) {
+            if (!node.layer)
+                node.layer = 0;
+            else
+                node.layer *= 2; // TODO: 因为默认的rank变为两倍，设定的layer也*2
+        }
+    });
+    g.edges().forEach(function (e) {
+        var _a;
+        var edge = g.edge(e);
+        edge.minlen *= 2;
+        if (((_a = edge.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== "c") {
+            if (graph.rankdir === "TB" || graph.rankdir === "BT") {
+                edge.width += edge.labeloffset;
+            }
+            else {
+                edge.height += edge.labeloffset;
+            }
+        }
+    });
+};
+/*
+ * Creates temporary dummy nodes that capture the rank in which each edge's
+ * label is going to, if it has one of non-zero width and height. We do this
+ * so that we can safely remove empty ranks while preserving balance for the
+ * label's position.
+ */
+var injectEdgeLabelProxies = function (g) {
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        if (edge.width && edge.height) {
+            var v = g.node(e.v);
+            var w = g.node(e.w);
+            var label = { e: e, rank: (w.rank - v.rank) / 2 + v.rank };
+            util_1.default.addDummyNode(g, "edge-proxy", label, "_ep");
+        }
+    });
+};
+var assignRankMinMax = function (g) {
+    var maxRank = 0;
+    g.nodes().forEach(function (v) {
+        var node = g.node(v);
+        if (node.borderTop) {
+            node.minRank = g.node(node.borderTop).rank;
+            node.maxRank = g.node(node.borderBottom).rank;
+            maxRank = Math.max(maxRank, node.maxRank || -Infinity);
+        }
+    });
+    g.graph().maxRank = maxRank;
+};
+var removeEdgeLabelProxies = function (g) {
+    g.nodes().forEach(function (v) {
+        var node = g.node(v);
+        if (node.dummy === "edge-proxy") {
+            g.edge(node.e).labelRank = node.rank;
+            g.removeNode(v);
+        }
+    });
+};
+var translateGraph = function (g) {
+    var minX = Number.POSITIVE_INFINITY;
+    var maxX = 0;
+    var minY = Number.POSITIVE_INFINITY;
+    var maxY = 0;
+    var graphLabel = g.graph();
+    var marginX = graphLabel.marginx || 0;
+    var marginY = graphLabel.marginy || 0;
+    var getExtremes = function (attrs) {
+        var x = attrs.x;
+        var y = attrs.y;
+        var w = attrs.width;
+        var h = attrs.height;
+        minX = Math.min(minX, x - w / 2);
+        maxX = Math.max(maxX, x + w / 2);
+        minY = Math.min(minY, y - h / 2);
+        maxY = Math.max(maxY, y + h / 2);
+    };
+    g.nodes().forEach(function (v) { getExtremes(g.node(v)); });
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        if (edge.hasOwnProperty("x")) {
+            getExtremes(edge);
+        }
+    });
+    minX -= marginX;
+    minY -= marginY;
+    g.nodes().forEach(function (v) {
+        var node = g.node(v);
+        node.x -= minX;
+        node.y -= minY;
+    });
+    g.edges().forEach(function (e) {
+        var _a;
+        var edge = g.edge(e);
+        (_a = edge.points) === null || _a === void 0 ? void 0 : _a.forEach(function (p) {
+            p.x -= minX;
+            p.y -= minY;
+        });
+        if (edge.hasOwnProperty("x")) {
+            edge.x -= minX;
+        }
+        if (edge.hasOwnProperty("y")) {
+            edge.y -= minY;
+        }
+    });
+    graphLabel.width = maxX - minX + marginX;
+    graphLabel.height = maxY - minY + marginY;
+};
+var assignNodeIntersects = function (g) {
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        var nodeV = g.node(e.v);
+        var nodeW = g.node(e.w);
+        var p1;
+        var p2;
+        if (!edge.points) {
+            edge.points = [];
+            p1 = nodeW;
+            p2 = nodeV;
+        }
+        else {
+            p1 = edge.points[0];
+            p2 = edge.points[edge.points.length - 1];
+        }
+        edge.points.unshift(util_1.default.intersectRect(nodeV, p1));
+        edge.points.push(util_1.default.intersectRect(nodeW, p2));
+    });
+};
+var fixupEdgeLabelCoords = function (g) {
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        if (edge.hasOwnProperty("x")) {
+            if (edge.labelpos === "l" || edge.labelpos === "r") {
+                edge.width -= edge.labeloffset;
+            }
+            switch (edge.labelpos) {
+                case "l":
+                    edge.x -= edge.width / 2 + edge.labeloffset;
+                    break;
+                case "r":
+                    edge.x += edge.width / 2 + edge.labeloffset;
+                    break;
+            }
+        }
+    });
+};
+var reversePointsForReversedEdges = function (g) {
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        if (edge.reversed) {
+            edge.points.reverse();
+        }
+    });
+};
+var removeBorderNodes = function (g) {
+    g.nodes().forEach(function (v) {
+        var _a, _b, _c;
+        if ((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
+            var node = g.node(v);
+            var t = g.node(node.borderTop);
+            var b = g.node(node.borderBottom);
+            var l = g.node(node.borderLeft[((_b = node.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
+            var r = g.node(node.borderRight[((_c = node.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
+            node.width = Math.abs(r.x - l.x);
+            node.height = Math.abs(b.y - t.y);
+            node.x = l.x + node.width / 2;
+            node.y = t.y + node.height / 2;
+        }
+    });
+    g.nodes().forEach(function (v) {
+        if (g.node(v).dummy === "border") {
+            g.removeNode(v);
+        }
+    });
+};
+var removeSelfEdges = function (g) {
+    g.edges().forEach(function (e) {
+        if (e.v === e.w) {
+            var node = g.node(e.v);
+            if (!node.selfEdges) {
+                node.selfEdges = [];
+            }
+            node.selfEdges.push({ e: e, label: g.edge(e) });
+            g.removeEdge(e);
+        }
+    });
+};
+var insertSelfEdges = function (g) {
+    var layers = util_1.default.buildLayerMatrix(g);
+    layers.forEach(function (layer) {
+        var orderShift = 0;
+        layer.forEach(function (v, i) {
+            var _a;
+            var node = g.node(v);
+            node.order = i + orderShift;
+            (_a = node.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach(function (selfEdge) {
+                util_1.default.addDummyNode(g, "selfedge", {
+                    width: selfEdge.label.width,
+                    height: selfEdge.label.height,
+                    rank: node.rank,
+                    order: i + (++orderShift),
+                    e: selfEdge.e,
+                    label: selfEdge.label
+                }, "_se");
+            });
+            delete node.selfEdges;
+        });
+    });
+};
+var positionSelfEdges = function (g) {
+    g.nodes().forEach(function (v) {
+        var node = g.node(v);
+        if (node.dummy === "selfedge") {
+            var selfNode = g.node(node.e.v);
+            var x = selfNode.x + selfNode.width / 2;
+            var y = selfNode.y;
+            var dx = node.x - x;
+            var dy = selfNode.height / 2;
+            g.setEdge(node.e, node.label);
+            g.removeNode(v);
+            node.label.points = [
+                { x: x + 2 * dx / 3, y: y - dy },
+                { x: x + 5 * dx / 6, y: y - dy },
+                { y: y, x: x + dx },
+                { x: x + 5 * dx / 6, y: y + dy },
+                { x: x + 2 * dx / 3, y: y + dy }
+            ];
+            node.label.x = node.x;
+            node.label.y = node.y;
+        }
+    });
+};
+var selectNumberAttrs = function (obj, attrs) {
+    var pickedProperties = {};
+    attrs.forEach(function (key) {
+        if (obj[key] === undefined)
+            return;
+        pickedProperties[key] = (+obj[key]);
+    });
+    return pickedProperties;
+};
+var canonicalize = function (attrs) {
+    var newAttrs = {};
+    Object.keys(attrs).forEach(function (k) {
+        var v = attrs[k];
+        newAttrs[k.toLowerCase()] = v;
+    });
+    return newAttrs;
+};
+exports.default = layout;
+//# sourceMappingURL=layout.js.map