@antv/layout 1.1.0 → 1.2.1

package/lib/dagre/util.js

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

package/lib/dagre/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/dagre/util.ts"],"names":[],"mappings":";AAAA,OAAO,EAAM,KAAK,EAAQ,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC,IAAM,QAAQ,GAAG,UAAC,MAAe,EAAE,MAAe;IAChD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,IAAM,YAAY,GAAG,UAC1B,CAAS,EACT,IAAY,EACZ,IAAc,EACd,IAAY;IAEZ,IAAI,CAAK,CAAC;IACV,GAAG;QACD,CAAC,GAAG,KAAG,IAAI,GAAG,IAAI,CAAC,MAAM,EAAI,CAAC;KAC/B,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;IAEvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IAClB,CAAC,CAAC,OAAO,CAAC;QACR,EAAE,EAAE,CAAC;QACL,IAAI,MAAA;KACL,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,IAAM,QAAQ,GAAG,UAAC,CAAS;IAChC,IAAM,UAAU,GAAG,IAAI,KAAK,EAAsB,CAAC;IACnD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,UAAU,CAAC,OAAO,cAAM,CAAC,EAAG,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAM,IAAI,GAAG,UAAU;aACpB,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;aAChC,IAAI,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAxB,CAAwB,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,EAAE;YACT,UAAU,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,IAAI,EAAE;oBACJ,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;oBAC3B,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;iBAC5B;aACF,CAAC,CAAC;SACJ;aAAM;YACL,UAAU,CAAC,cAAc,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAG,wBAC9B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,EAC/C,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,IACxD,CAAC;SACJ;IACH,CAAC,CAAC,CAAC;IACH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,kBAAkB,GAAG,UAAC,CAAS;IAC1C,IAAM,UAAU,GAAG,IAAI,KAAK,EAAE,CAAC;IAE/B,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;YAClC,UAAU,CAAC,OAAO,cAAM,IAAI,EAAG,CAAC;SACjC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,SAAS,GAAG,UAAU,IAAU,EAAE,MAAW;IACxD,OAAO,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,CAAC,UAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC9B,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC,EAAE,EAAmB,CAAC,CAAC;AAC1B,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,gBAAgB,GAAG,UAAC,CAAS;IACxC,IAAM,UAAU,GAAuC,EAAE,CAAC;IAE1D,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAM,IAAI,GAAuB,EAAE,CAAC;QACpC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YAC1C,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QACH,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,kBAAkB,GAAG,UAAC,CAAS;IAC1C,IAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAE9B,IAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,UAAC,CAAC;QAC5B,IAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YACtC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;QAC5D,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,OAAO,SAAS,CACd,KAAK,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,EAAJ,CAAI,CAAC,EACtB,SAAS,CACV,CAAC;AACJ,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,IAAM,aAAa,GAAG,UAC3B,IAAiE,EACjE,KAAiC;IAEjC,IAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,IAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzB,yCAAyC;IACzC,6EAA6E;IAC7E,IAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEhC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACd,8DAA8D;QAC9D,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;KACvB;IAED,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IAEP,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;QACvC,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACnB,EAAE,GAAG,CAAC,CAAC;KACR;SAAM;QACL,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC;QACP,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;KACpB;IAED,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;AAClC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,IAAM,gBAAgB,GAAG,UAAC,CAAS;IACxC,IAAM,aAAa,GAAW,EAAE,CAAC;IACjC,IAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACxB;IAED,8EAA8E;IAC9E,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YAC7C,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACnC;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAC,EAAM,EAAE,EAAM;YACtD,OAAA,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAM,CAAC;QAA9D,CAA8D,CAC/D,CAAC;KACH;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,IAAM,cAAc,GAAG,UAAC,CAAS;IACtC,IAAM,SAAS,GAAG,CAAC;SAChB,WAAW,EAAE;SACb,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAzB,CAAyB,CAAC;SACxC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,IAAK,EAAZ,CAAY,CAAC,CAAC;IAC5B,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,SAAS,GAAC,CAAC;IACnC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE;YACrD,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG,CAAC;SACrB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,gBAAgB,GAAG,UAAC,CAAS,EAAE,cAA0B;IAA1B,+BAAA,EAAA,kBAA0B;IACpE,sDAAsD;IACtD,IAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC9B,IAAM,SAAS,GAAG,KAAK;SACpB,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAzB,CAAyB,CAAC;SACxC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,IAAK,EAAZ,CAAY,CAAC,CAAC;IAE5B,IAAM,MAAM,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,SAAS,GAAC,CAAC;IACtC,IAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,KAAK,CAAC,OAAO,CAAC,UAAC,CAAC;QACd,IAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAE1C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACjB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;SACnB;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE;YACpB,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC,CAAC;aACZ;SACF;aAAM,IAAI,KAAK,EAAE;YAChB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,UAAC,CAAK;gBAChB,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,IAAI,EAAE;oBACR,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;oBACrC,IAAI,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK,CAAC;iBAC1B;YACH,CAAC,CAAC,CAAC;SACJ;KACF;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,aAAa,GAAG,UAC3B,CAAS,EACT,MAAc,EACd,IAAa,EACb,KAAc;IAEd,IAAM,IAAI,GAAa;QACrB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;KACV,CAAC;IACF,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;KACpB;IACD,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,OAAO,GAAG,UAAC,CAAS;IAC/B,IAAI,OAAe,CAAC;IACpB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;YACtB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;gBAC3C,OAAO,GAAG,IAAI,CAAC;aAChB;SACF;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,OAAQ,EAAE;QACb,OAAO,GAAG,CAAC,CAAC;KACb;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,IAAM,SAAS,GAAG,UACvB,UAAe,EACf,EAAuB;IAEvB,IAAM,MAAM,GAAG,EAAE,GAAG,EAAE,EAAS,EAAE,GAAG,EAAE,EAAS,EAAE,CAAC;IAClD,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,CAAC,UAAC,KAAK;QACxB,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;aAAM;YACL,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,KAAK,GAAG,UAAU,KAAU,EAAE,IAA0B;IACnE,OAAO,KAAK,CAAC,MAAM,CAAC,UAAC,CAAC,EAAE,CAAC;QACvB,IAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,KAAK,GAAG,UACZ,KAAa,EACb,IAAoB,EACpB,SAAkB,EAClB,OAAa,EACb,SAAsC,EACtC,MAAY;IAEZ,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,EAAE;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACtB;QACD,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YAC3B,OAAA,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC;QAAtD,CAAsD,CACvD,CAAC;QACF,IAAI,SAAS,EAAE;YACb,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACtB;KACF;AACH,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,IAAM,GAAG,GAAG,UACjB,KAAa,EACb,IAAuC,EACvC,KAAqB,EACrB,UAAmB;IAEnB,IAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,IAAM,SAAS,GAAG,UAAC,CAAK;QACtB,OAAA,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAE;IAA9D,CAA8D,CAAC;IACjE,IAAM,OAAO,GAAS,EAAE,CAAC;IACzB,IAAM,OAAO,GAAS,EAAE,CAAC;IACzB,KAAK,CAAC,OAAO,CAAC,UAAC,IAAI;QACjB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,+BAA6B,IAAM,CAAC,CAAC;SACtD;aAAM;YACL,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;SACnE;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC"}

package/lib/dagre.d.ts

@@ -1,4 +1,4 @@
-import type { Graph as IGraph, Layout, LayoutMapping, Node, DagreLayoutOptions } from "./types";
+import type { Graph as IGraph, Layout, LayoutMapping, DagreLayoutOptions } from "./types";
 /**
  * Layout arranging the nodes in a circle.
  *
@@ -27,5 +27,4 @@ export declare class DagreLayout implements Layout<DagreLayoutOptions> {
      */
     assign(graph: IGraph, options?: DagreLayoutOptions): Promise<void>;
     private genericDagreLayout;
-    layoutNode: (node: Node) => boolean;
 }