@antv/layout 0.1.19 → 0.1.20

package/lib/layout/dagre/index.js

@@ -0,0 +1,38 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+/*
+Copyright (c) 2012-2014 Chris Pettitt
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+*/
+var graphlib_1 = __importDefault(require("./src/graphlib"));
+var layout_1 = __importDefault(require("./src/layout"));
+var util_1 = require("./src/util");
+exports.default = {
+    graphlib: graphlib_1.default,
+    layout: layout_1.default,
+    util: {
+        time: util_1.time,
+        notime: util_1.notime
+    },
+};
+//# sourceMappingURL=index.js.map

package/lib/layout/dagre/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/layout/dagre/index.ts"],"names":[],"mappings":";;;;;AAAA;;;;;;;;;;;;;;;;;;;;EAoBE;AACF,4DAAsC;AACtC,wDAAkC;AAClC,mCAA0C;AAE1C,kBAAe;IACb,QAAQ,oBAAA;IACR,MAAM,kBAAA;IACN,IAAI,EAAE;QACJ,IAAI,aAAA;QACJ,MAAM,eAAA;KACP;CACF,CAAC"}

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

@@ -0,0 +1,7 @@
+import { graphlib } from '../graphlib';
+declare type Graph = graphlib.Graph;
+declare const _default: {
+    run: (g: Graph) => void;
+    undo: (g: Graph) => void;
+};
+export default _default;

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

@@ -0,0 +1,57 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var greedy_fas_1 = __importDefault(require("./greedy-fas"));
+var run = function (g) {
+    var weightFn = function (g) {
+        return function (e) { return g.edge(e).weight; };
+    };
+    var fas = (g.graph().acyclicer === "greedy" ? (0, greedy_fas_1.default)(g, weightFn(g)) : dfsFAS(g));
+    fas.forEach(function (e) {
+        var label = g.edge(e);
+        g.removeEdge(e);
+        label.forwardName = e.name;
+        label.reversed = true;
+        g.setEdge(e.w, e.v, label, "rev-" + Math.random());
+    });
+};
+var dfsFAS = function (g) {
+    var fas = [];
+    var stack = {};
+    var visited = {};
+    var dfs = function (v) {
+        var _a;
+        if (visited.hasOwnProperty(v)) {
+            return;
+        }
+        visited[v] = true;
+        stack[v] = true;
+        (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
+            if (stack.hasOwnProperty(e.w)) {
+                fas.push(e);
+            }
+            else {
+                dfs(e.w);
+            }
+        });
+        delete stack[v];
+    };
+    g.nodes().forEach(dfs);
+    return fas;
+};
+var undo = function (g) {
+    g.edges().forEach(function (e) {
+        var label = g.edge(e);
+        if (label.reversed) {
+            g.removeEdge(e);
+            var forwardName = label.forwardName;
+            delete label.reversed;
+            delete label.forwardName;
+            g.setEdge(e.w, e.v, label, forwardName);
+        }
+    });
+};
+exports.default = { run: run, undo: undo };
+//# sourceMappingURL=acyclic.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"acyclic.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/acyclic.ts"],"names":[],"mappings":";;;;;AACA,4DAAqC;AAIrC,IAAM,GAAG,GAAG,UAAC,CAAQ;IACnB,IAAM,QAAQ,GAAG,UAAC,CAAQ;QACxB,OAAO,UAAC,CAAO,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAhB,CAAgB,CAAC;IACvC,CAAC,CAAC;IACF,IAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAA,oBAAS,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,GAAG,CAAC,OAAO,CAAC,UAAC,CAAO;QAClB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC;QAC3B,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAO,IAAI,CAAC,MAAM,EAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,MAAM,GAAG,UAAC,CAAQ;IACtB,IAAM,GAAG,GAAW,EAAE,CAAC;IACvB,IAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,IAAM,GAAG,GAAG,UAAC,CAAM;;QACjB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO;SACR;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAChB,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;YACvB,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC7B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACb;iBAAM;gBACL,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACV;QACH,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,IAAM,IAAI,GAAG,UAAC,CAAQ;IACpB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,CAAC,QAAQ,EAAE;YAClB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAEhB,IAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;YACtC,OAAO,KAAK,CAAC,QAAQ,CAAC;YACtB,OAAO,KAAK,CAAC,WAAW,CAAC;YACzB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;SACzC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,EAAE,GAAG,KAAA,EAAE,IAAI,MAAA,EAAE,CAAC"}

package/lib/layout/dagre/src/add-border-segments.d.ts

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

package/lib/layout/dagre/src/add-border-segments.js

@@ -0,0 +1,37 @@
+"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 addBorderSegments = function (g) {
+    var _a;
+    var dfs = function (v) {
+        var children = g.children(v);
+        var node = g.node(v);
+        if (children === null || children === void 0 ? void 0 : children.length) {
+            children.forEach(function (child) { return dfs(child); });
+        }
+        if (node.hasOwnProperty('minRank')) {
+            node.borderLeft = [];
+            node.borderRight = [];
+            for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {
+                addBorderNode(g, "borderLeft", "_bl", v, node, rank);
+                addBorderNode(g, "borderRight", "_br", v, node, rank);
+            }
+        }
+    };
+    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(function (child) { return dfs(child); });
+};
+var addBorderNode = function (g, prop, prefix, sg, sgNode, rank) {
+    var label = { rank: rank, width: 0, height: 0, borderType: prop };
+    var prev = sgNode[prop][rank - 1];
+    var curr = util_1.default.addDummyNode(g, "border", label, prefix);
+    sgNode[prop][rank] = curr;
+    g.setParent(curr, sg);
+    if (prev) {
+        g.setEdge(prev, curr, { weight: 1 });
+    }
+};
+exports.default = addBorderSegments;
+//# sourceMappingURL=add-border-segments.js.map

package/lib/layout/dagre/src/add-border-segments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-border-segments.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/add-border-segments.ts"],"names":[],"mappings":";;;;;AACA,gDAA0B;AAI1B,IAAM,iBAAiB,GAAG,UAAC,CAAQ;;IACjC,IAAM,GAAG,GAAG,UAAC,CAAS;QACpB,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAM,IAAI,GAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;YACpB,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAK,CAAC,EAAV,CAAU,CAAC,CAAC;SACzC;QAED,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE;YAClC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EACtD,IAAI,GAAG,OAAO,EACd,EAAE,IAAI,EAAE;gBACR,aAAa,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrD,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;aACvD;SACF;IACH,CAAC,CAAC;IAEF,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAK,CAAC,EAAV,CAAU,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEF,IAAM,aAAa,GAAG,UAAC,CAAQ,EAAE,IAAY,EAAE,MAAc,EAAE,EAAU,EAAE,MAAW,EAAE,IAAY;IAClG,IAAM,KAAK,GAAG,EAAE,IAAI,MAAA,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;IAC9D,IAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACpC,IAAM,IAAI,GAAG,cAAI,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAC1B,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtB,IAAI,IAAI,EAAE;QACR,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;KACtC;AACH,CAAC,CAAC;AAEF,kBAAe,iBAAiB,CAAC"}

package/lib/layout/dagre/src/coordinate-system.d.ts

@@ -0,0 +1,7 @@
+import { graphlib } from "../graphlib";
+declare type Graph = graphlib.Graph;
+declare const _default: {
+    adjust: (g: Graph) => void;
+    undo: (g: Graph) => void;
+};
+export default _default;

package/lib/layout/dagre/src/coordinate-system.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var adjust = function (g) {
+    var _a;
+    var rankDir = (_a = g.graph().rankdir) === null || _a === void 0 ? void 0 : _a.toLowerCase();
+    if (rankDir === "lr" || rankDir === "rl") {
+        swapWidthHeight(g);
+    }
+};
+var undo = function (g) {
+    var _a;
+    var rankDir = (_a = g.graph().rankdir) === null || _a === void 0 ? void 0 : _a.toLowerCase();
+    if (rankDir === "bt" || rankDir === "rl") {
+        reverseY(g);
+    }
+    if (rankDir === "lr" || rankDir === "rl") {
+        swapXY(g);
+        swapWidthHeight(g);
+    }
+};
+var swapWidthHeight = function (g) {
+    g.nodes().forEach(function (v) { swapWidthHeightOne(g.node(v)); });
+    g.edges().forEach(function (e) { swapWidthHeightOne(g.edge(e)); });
+};
+var swapWidthHeightOne = function (attrs) {
+    var w = attrs.width;
+    attrs.width = attrs.height;
+    attrs.height = w;
+};
+var reverseY = function (g) {
+    g.nodes().forEach(function (v) { reverseYOne(g.node(v)); });
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        edge.points.forEach(function (point) { return reverseYOne(point); });
+        if (edge.hasOwnProperty("y")) {
+            reverseYOne(edge);
+        }
+    });
+};
+var reverseYOne = function (attrs) {
+    attrs.y = -attrs.y;
+};
+var swapXY = function (g) {
+    g.nodes().forEach(function (v) { swapXYOne(g.node(v)); });
+    g.edges().forEach(function (e) {
+        var edge = g.edge(e);
+        edge.points.forEach(function (point) { return swapXYOne(point); });
+        if (edge.hasOwnProperty("x")) {
+            swapXYOne(edge);
+        }
+    });
+};
+var swapXYOne = function (attrs) {
+    var x = attrs.x;
+    attrs.x = attrs.y;
+    attrs.y = x;
+};
+exports.default = { adjust: adjust, undo: undo };
+//# sourceMappingURL=coordinate-system.js.map

package/lib/layout/dagre/src/coordinate-system.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-system.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/coordinate-system.ts"],"names":[],"mappings":";;AAIA,IAAM,MAAM,GAAG,UAAC,CAAQ;;IACtB,IAAM,OAAO,GAAG,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,0CAAE,WAAW,EAAE,CAAC;IACjD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;QACxC,eAAe,CAAC,CAAC,CAAC,CAAC;KACpB;AACH,CAAC,CAAC;AAEF,IAAM,IAAI,GAAG,UAAC,CAAQ;;IACpB,IAAM,OAAO,GAAG,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,0CAAE,WAAW,EAAE,CAAC;IACjD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;QACxC,QAAQ,CAAC,CAAC,CAAC,CAAC;KACb;IAED,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;QACxC,MAAM,CAAC,CAAC,CAAC,CAAC;QACV,eAAe,CAAC,CAAC,CAAC,CAAC;KACpB;AACH,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,CAAQ;IAC/B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF,IAAM,kBAAkB,GAAG,UAAC,KAAU;IACpC,IAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACtB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACnB,CAAC,CAAC;AAEF,IAAM,QAAQ,GAAG,UAAC,CAAQ;IACxB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,WAAW,CAAC,KAAK,CAAC,EAAlB,CAAkB,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,WAAW,CAAC,IAAI,CAAC,CAAC;SACnB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,KAAU;IAC7B,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACrB,CAAC,CAAC;AAEF,IAAM,MAAM,GAAG,UAAC,CAAQ;IACtB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,SAAS,CAAC,KAAK,CAAC,EAAhB,CAAgB,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,SAAS,CAAC,IAAI,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,KAAU;IAC3B,IAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAClB,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAClB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;AACd,CAAC,CAAC;AAEF,kBAAe,EAAE,MAAM,QAAA,EAAE,IAAI,MAAA,EAAE,CAAC"}

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

@@ -0,0 +1,8 @@
+declare class List {
+    isentinel: any;
+    constructor();
+    dequeue(): any;
+    enqueue(): any;
+    toString(): string;
+}
+export default List;

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

@@ -0,0 +1,53 @@
+"use strict";
+/*
+ * Simple doubly linked list implementation derived from Cormen, et al.,
+ * "Introduction to Algorithms".
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+var unlink = function (entry) {
+    entry._prev._next = entry._next;
+    entry._next._prev = entry._prev;
+    delete entry._next;
+    delete entry._prev;
+};
+var filterOutLinks = function (k, v) {
+    if (k !== "_next" && k !== "_prev") {
+        return v;
+    }
+};
+var List = /** @class */ (function () {
+    function List() {
+        var sentinel = {};
+        sentinel._next = sentinel._prev = sentinel;
+        this.isentinel = sentinel;
+    }
+    List.prototype.dequeue = function () {
+        var sentinel = this.isentinel;
+        var entry = sentinel._prev;
+        if (entry !== sentinel) {
+            unlink(entry);
+            return entry;
+        }
+    };
+    List.prototype.enqueue = function () {
+        var sentinel = this.isentinel;
+        var entry = sentinel._prev;
+        if (entry !== sentinel) {
+            unlink(entry);
+            return entry;
+        }
+    };
+    List.prototype.toString = function () {
+        var strs = [];
+        var sentinel = this.isentinel;
+        var curr = sentinel._prev;
+        while (curr !== sentinel) {
+            strs.push(JSON.stringify(curr, filterOutLinks));
+            curr = curr._prev;
+        }
+        return "[" + strs.join(", ") + "]";
+    };
+    return List;
+}());
+exports.default = List;
+//# sourceMappingURL=list.js.map

package/lib/layout/dagre/src/data/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/data/list.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,IAAM,MAAM,GAAG,UAAC,KAAU;IACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAChC,OAAO,KAAK,CAAC,KAAK,CAAC;IACnB,OAAO,KAAK,CAAC,KAAK,CAAC;AACrB,CAAC,CAAC;AAEF,IAAM,cAAc,GAAG,UAAC,CAAS,EAAE,CAAS;IAC1C,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,OAAO,EAAE;QAClC,OAAO,CAAC,CAAC;KACV;AACH,CAAC,CAAC;AAEF;IAGE;QACE,IAAM,QAAQ,GAAQ,EAAE,CAAC;QACzB,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC;QAC3C,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC5B,CAAC;IAEM,sBAAO,GAAd;QACE,IAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC7B,IAAI,KAAK,KAAK,QAAQ,EAAE;YACtB,MAAM,CAAC,KAAK,CAAC,CAAC;YACd,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAEM,sBAAO,GAAd;QACE,IAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC7B,IAAI,KAAK,KAAK,QAAQ,EAAE;YACtB,MAAM,CAAC,KAAK,CAAC,CAAC;YACd,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAEM,uBAAQ,GAAf;QACE,IAAM,IAAI,GAAG,EAAE,CAAC;QAChB,IAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC1B,OAAO,IAAI,KAAK,QAAQ,EAAE;YACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;SACnB;QACD,OAAO,MAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAG,CAAC;IAChC,CAAC;IACH,WAAC;AAAD,CAAC,AArCD,IAqCC;AAED,kBAAe,IAAI,CAAC"}

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

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

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.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,CAAC,MAAM,CAAC,UAAC,CAAS,EAAE,CAAS;YAChC,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;