@antv/layout 0.1.19 → 0.1.20

package/es/layout/dagre/index.d.ts

@@ -0,0 +1,9 @@
+declare const _default: {
+    graphlib: any;
+    layout: (g: import("./graphlib").graphlib.Graph<{}>, opts: any) => void;
+    util: {
+        time: (name: string, fn: () => unknown) => unknown;
+        notime: (name: string, fn: () => unknown) => unknown;
+    };
+};
+export default _default;

package/es/layout/dagre/index.js

@@ -0,0 +1,33 @@
+/*
+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.
+*/
+import graphlib from './src/graphlib';
+import layout from './src/layout';
+import { time, notime } from './src/util';
+export default {
+    graphlib,
+    layout,
+    util: {
+        time,
+        notime
+    },
+};
+//# sourceMappingURL=index.js.map

package/es/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,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,MAAM,MAAM,cAAc,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE1C,eAAe;IACb,QAAQ;IACR,MAAM;IACN,IAAI,EAAE;QACJ,IAAI;QACJ,MAAM;KACP;CACF,CAAC"}

package/es/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/es/layout/dagre/src/acyclic.js

@@ -0,0 +1,52 @@
+import greedyFAS from './greedy-fas';
+const run = (g) => {
+    const weightFn = (g) => {
+        return (e) => g.edge(e).weight;
+    };
+    const fas = (g.graph().acyclicer === "greedy" ? greedyFAS(g, weightFn(g)) : dfsFAS(g));
+    fas.forEach((e) => {
+        const label = g.edge(e);
+        g.removeEdge(e);
+        label.forwardName = e.name;
+        label.reversed = true;
+        g.setEdge(e.w, e.v, label, `rev-${Math.random()}`);
+    });
+};
+const dfsFAS = (g) => {
+    const fas = [];
+    const stack = {};
+    const visited = {};
+    const dfs = (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((e) => {
+            if (stack.hasOwnProperty(e.w)) {
+                fas.push(e);
+            }
+            else {
+                dfs(e.w);
+            }
+        });
+        delete stack[v];
+    };
+    g.nodes().forEach(dfs);
+    return fas;
+};
+const undo = (g) => {
+    g.edges().forEach((e) => {
+        const label = g.edge(e);
+        if (label.reversed) {
+            g.removeEdge(e);
+            const forwardName = label.forwardName;
+            delete label.reversed;
+            delete label.forwardName;
+            g.setEdge(e.w, e.v, label, forwardName);
+        }
+    });
+};
+export default { run, undo };
+//# sourceMappingURL=acyclic.js.map

package/es/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,OAAO,SAAS,MAAM,cAAc,CAAC;AAIrC,MAAM,GAAG,GAAG,CAAC,CAAQ,EAAE,EAAE;IACvB,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAO,EAAE;QACjC,OAAO,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,GAAG,CAAC,OAAO,CAAC,CAAC,CAAO,EAAE,EAAE;QACtB,MAAM,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,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1B,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,MAAM,GAAG,GAAG,CAAC,CAAM,EAAE,EAAE;;QACrB,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,CAAC,CAAC,EAAE,EAAE;YAC3B,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,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,CAAC,QAAQ,EAAE;YAClB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAEhB,MAAM,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,eAAe,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC"}

package/es/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/es/layout/dagre/src/add-border-segments.js

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

package/es/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,OAAO,IAAI,MAAM,QAAQ,CAAC;AAI1B,MAAM,iBAAiB,GAAG,CAAC,CAAQ,EAAE,EAAE;;IACrC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;QACxB,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;YACpB,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,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,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,CAAQ,EAAE,IAAY,EAAE,MAAc,EAAE,EAAU,EAAE,MAAW,EAAE,IAAY,EAAE,EAAE;IACtG,MAAM,KAAK,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;IAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,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,eAAe,iBAAiB,CAAC"}

package/es/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/es/layout/dagre/src/coordinate-system.js

@@ -0,0 +1,57 @@
+const adjust = (g) => {
+    var _a;
+    const rankDir = (_a = g.graph().rankdir) === null || _a === void 0 ? void 0 : _a.toLowerCase();
+    if (rankDir === "lr" || rankDir === "rl") {
+        swapWidthHeight(g);
+    }
+};
+const undo = (g) => {
+    var _a;
+    const 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);
+    }
+};
+const swapWidthHeight = (g) => {
+    g.nodes().forEach((v) => { swapWidthHeightOne(g.node(v)); });
+    g.edges().forEach((e) => { swapWidthHeightOne(g.edge(e)); });
+};
+const swapWidthHeightOne = (attrs) => {
+    const w = attrs.width;
+    attrs.width = attrs.height;
+    attrs.height = w;
+};
+const reverseY = (g) => {
+    g.nodes().forEach((v) => { reverseYOne(g.node(v)); });
+    g.edges().forEach((e) => {
+        const edge = g.edge(e);
+        edge.points.forEach((point) => reverseYOne(point));
+        if (edge.hasOwnProperty("y")) {
+            reverseYOne(edge);
+        }
+    });
+};
+const reverseYOne = (attrs) => {
+    attrs.y = -attrs.y;
+};
+const swapXY = (g) => {
+    g.nodes().forEach((v) => { swapXYOne(g.node(v)); });
+    g.edges().forEach((e) => {
+        const edge = g.edge(e);
+        edge.points.forEach((point) => swapXYOne(point));
+        if (edge.hasOwnProperty("x")) {
+            swapXYOne(edge);
+        }
+    });
+};
+const swapXYOne = (attrs) => {
+    const x = attrs.x;
+    attrs.x = attrs.y;
+    attrs.y = x;
+};
+export default { adjust, undo };
+//# sourceMappingURL=coordinate-system.js.map

package/es/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,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;;IAC1B,MAAM,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,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;;IACxB,MAAM,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,MAAM,eAAe,GAAG,CAAC,CAAQ,EAAE,EAAE;IACnC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,KAAU,EAAE,EAAE;IACxC,MAAM,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,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC5B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,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,MAAM,WAAW,GAAG,CAAC,KAAU,EAAE,EAAE;IACjC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,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,MAAM,SAAS,GAAG,CAAC,KAAU,EAAE,EAAE;IAC/B,MAAM,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,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC"}

package/es/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/es/layout/dagre/src/data/list.js

@@ -0,0 +1,50 @@
+/*
+ * Simple doubly linked list implementation derived from Cormen, et al.,
+ * "Introduction to Algorithms".
+ */
+const unlink = (entry) => {
+    entry._prev._next = entry._next;
+    entry._next._prev = entry._prev;
+    delete entry._next;
+    delete entry._prev;
+};
+const filterOutLinks = (k, v) => {
+    if (k !== "_next" && k !== "_prev") {
+        return v;
+    }
+};
+class List {
+    constructor() {
+        const sentinel = {};
+        sentinel._next = sentinel._prev = sentinel;
+        this.isentinel = sentinel;
+    }
+    dequeue() {
+        const sentinel = this.isentinel;
+        const entry = sentinel._prev;
+        if (entry !== sentinel) {
+            unlink(entry);
+            return entry;
+        }
+    }
+    enqueue() {
+        const sentinel = this.isentinel;
+        const entry = sentinel._prev;
+        if (entry !== sentinel) {
+            unlink(entry);
+            return entry;
+        }
+    }
+    toString() {
+        const strs = [];
+        const sentinel = this.isentinel;
+        let curr = sentinel._prev;
+        while (curr !== sentinel) {
+            strs.push(JSON.stringify(curr, filterOutLinks));
+            curr = curr._prev;
+        }
+        return `[${strs.join(", ")}]`;
+    }
+}
+export default List;
+//# sourceMappingURL=list.js.map

package/es/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,MAAM,MAAM,GAAG,CAAC,KAAU,EAAE,EAAE;IAC5B,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,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,OAAO,EAAE;QAClC,OAAO,CAAC,CAAC;KACV;AACH,CAAC,CAAC;AAEF,MAAM,IAAI;IAGR;QACE,MAAM,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,OAAO;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,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,OAAO;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,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,QAAQ;QACb,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,MAAM,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,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAChC,CAAC;CACF;AAED,eAAe,IAAI,CAAC"}

package/es/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/es/layout/dagre/src/debug.js

@@ -0,0 +1,26 @@
+import util from './util';
+import graphlib from './graphlib';
+const Graph = graphlib.Graph;
+/* istanbul ignore next */
+const debugOrdering = (g) => {
+    const layerMatrix = util.buildLayerMatrix(g);
+    const h = new Graph({ compound: true, multigraph: true }).setGraph({});
+    g.nodes().forEach((v) => {
+        h.setNode(v, { label: v });
+        h.setParent(v, `layer${g.node(v).rank}`);
+    });
+    g.edges().forEach((e) => {
+        h.setEdge(e.v, e.w, {}, e.name);
+    });
+    layerMatrix.forEach((layer, i) => {
+        const layerV = `layer${i}`;
+        h.setNode(layerV, { rank: "same" });
+        layer.reduce((u, v) => {
+            h.setEdge(u, v, { style: "invis" });
+            return v;
+        });
+    });
+    return h;
+};
+export default debugOrdering;
+//# sourceMappingURL=debug.js.map

package/es/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,OAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAIlC,MAAM,KAAK,GAAI,QAAgB,CAAC,KAAK,CAAC;AAEtC,0BAA0B;AAC1B,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,EAAE;IAClC,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAE7C,MAAM,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,CAAC,CAAS,EAAE,EAAE;QAC9B,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,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,CAAC,KAAU,EAAE,CAAS,EAAE,EAAE;QAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC;QAC3B,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACpC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;YACpC,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,eAAe,aAAa,CAAC"}

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

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

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

@@ -0,0 +1,8 @@
+// @ts-ignore
+import glib from '@dagrejs/graphlib';
+let graphlib = glib;
+if (!graphlib && typeof window !== "undefined") {
+    graphlib = window.graphlib;
+}
+export default graphlib;
+//# sourceMappingURL=graphlib.js.map

package/es/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,OAAO,IAAI,MAAM,mBAAmB,CAAC;AAErC,IAAI,QAAQ,GAAG,IAAI,CAAC;AAGpB,IAAI,CAAC,QAAQ,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IAC9C,QAAQ,GAAI,MAAc,CAAC,QAAQ,CAAC;CACrC;AAED,eAAe,QAAQ,CAAC"}

package/es/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/es/layout/dagre/src/greedy-fas.js

@@ -0,0 +1,113 @@
+import graphlib from './graphlib';
+import List from './data/list';
+const Graph = graphlib.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;
+const DEFAULT_WEIGHT_FN = () => 1;
+const greedyFAS = (g, weightFn) => {
+    var _a;
+    if (g.nodeCount() <= 1)
+        return [];
+    const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+    const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
+    // Expand multi-edges
+    // @ts-ignore
+    return (_a = results.map((e) => g.outEdges(e.v, e.w))) === null || _a === void 0 ? void 0 : _a.flat();
+};
+const doGreedyFAS = (g, buckets, zeroIdx) => {
+    let results = [];
+    const sources = buckets[buckets.length - 1];
+    const sinks = buckets[0];
+    let 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 (let 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;
+};
+const removeNode = (g, buckets, zeroIdx, entry, collectPredecessors) => {
+    var _a, _b;
+    const results = collectPredecessors ? [] : undefined;
+    (_a = g.inEdges(entry.v)) === null || _a === void 0 ? void 0 : _a.forEach((edge) => {
+        const weight = g.edge(edge);
+        const 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((edge) => {
+        const weight = g.edge(edge);
+        const w = edge.w;
+        const wEntry = g.node(w);
+        if (wEntry.in === undefined)
+            wEntry.in = 0;
+        wEntry.in -= weight;
+        assignBucket(buckets, zeroIdx, wEntry);
+    });
+    g.removeNode(entry.v);
+    return results;
+};
+const buildState = (g, weightFn) => {
+    const fasGraph = new Graph();
+    let maxIn = 0;
+    let maxOut = 0;
+    g.nodes().forEach((v) => {
+        fasGraph.setNode(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((e) => {
+        const prevWeight = fasGraph.edge(e.v, e.w) || 0;
+        const weight = weightFn === null || weightFn === void 0 ? void 0 : weightFn(e);
+        const 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);
+    });
+    const buckets = [];
+    const rangeMax = maxOut + maxIn + 3;
+    for (let i = 0; i < rangeMax; i++) {
+        buckets.push(new List());
+    }
+    const zeroIdx = maxIn + 1;
+    fasGraph.nodes().forEach((v) => {
+        assignBucket(buckets, zeroIdx, fasGraph.node(v));
+    });
+    return { buckets, zeroIdx, graph: fasGraph };
+};
+const assignBucket = (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);
+    }
+};
+export default greedyFAS;
+//# sourceMappingURL=greedy-fas.js.map

package/es/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,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,IAAI,MAAM,aAAa,CAAC;AAI/B,MAAM,KAAK,GAAI,QAAgB,CAAC,KAAK,CAAC;AAGtC;;;;;;GAMG;AACH,8BAA8B;AAE9B,MAAM,iBAAiB,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;AAElC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,QAAuB,EAAE,EAAE;;IACvD,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAC3D,MAAM,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,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,IAAI,EAAE,CAAC;AAC/D,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,OAAY,EAAE,OAAe,EAAE,EAAE;IAC/D,IAAI,OAAO,GAAW,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,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,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,OAAY,EAAE,OAAe,EAAE,KAAU,EAAE,mBAA6B,EAAE,EAAE;;IACzG,MAAM,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,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,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,CAAC,IAAI,EAAE,EAAE;QACpC,MAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,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,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,QAAkC,EAAE,EAAE;IACnE,MAAM,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,CAAC,CAAC,EAAE,EAAE;QACtB,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,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,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,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,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,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,IAAI,EAAE,CAAC,CAAC;KAC1B;IACD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;IAE1B,QAAQ,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACrC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,OAAY,EAAE,OAAe,EAAE,KAAU,EAAE,EAAE;IACjE,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,eAAe,SAAS,CAAC"}

package/es/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;