@antv/layout 0.3.11 → 1.0.0-alpha.0

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

@@ -1 +0,0 @@
-{"version":3,"file":"add-border-segments.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/add-border-segments.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAEtC,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,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,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,KACE,IAAI,IAAI,GAAG,IAAI,CAAC,OAAQ,EAAE,OAAO,GAAG,IAAI,CAAC,OAAQ,GAAG,CAAC,EACrD,IAAI,GAAG,OAAO,EACd,IAAI,IAAI,CAAC,EACT;gBACA,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,CACpB,CAAQ,EACR,IAAY,EACZ,MAAc,EACd,EAAU,EACV,MAAiC,EACjC,IAAY,EACZ,EAAE;IACF,MAAM,KAAK,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtD,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

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

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

@@ -1,69 +0,0 @@
-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) => {
-        var _a;
-        const edge = g.edge(e);
-        (_a = edge.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => reverseYOne(point));
-        if (edge.hasOwnProperty("y")) {
-            reverseYOne(edge);
-        }
-    });
-};
-const reverseYOne = (attrs) => {
-    if (attrs === null || attrs === void 0 ? void 0 : attrs.y) {
-        attrs.y = -attrs.y;
-    }
-};
-const swapXY = (g) => {
-    g.nodes().forEach((v) => {
-        swapXYOne(g.node(v));
-    });
-    g.edges().forEach((e) => {
-        var _a;
-        const edge = g.edge(e);
-        (_a = edge.points) === null || _a === void 0 ? void 0 : _a.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

@@ -1 +0,0 @@
-{"version":3,"file":"coordinate-system.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/coordinate-system.ts"],"names":[],"mappings":"AAEA,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;QACtB,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,KAA0C,EAAE,EAAE;IACxE,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;QACtB,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,MAAA,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,WAAW,CAAC,IAAqB,CAAC,CAAC;SACpC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,KAAqB,EAAE,EAAE;IAC5C,IAAI,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,CAAC,EAAE;QACZ,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;KACpB;AACH,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,MAAA,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QAClD,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

@@ -1,12 +0,0 @@
-type LinkedNode<T> = {
-    prev?: LinkedNode<T>;
-    next?: LinkedNode<T>;
-} & T;
-export default class List<T> {
-    shortcut: LinkedNode<T>;
-    constructor();
-    dequeue(): LinkedNode<T> | undefined;
-    enqueue(entry: LinkedNode<T>): void;
-    toString(): string;
-}
-export {};

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

@@ -1,48 +0,0 @@
-const filterOutLinks = (k, v) => {
-    if (k !== "next" && k !== "prev") {
-        return v;
-    }
-};
-const unlink = (entry) => {
-    entry.prev.next = entry.next;
-    entry.next.prev = entry.prev;
-    delete entry.next;
-    delete entry.prev;
-};
-export default class List {
-    constructor() {
-        const shortcut = {};
-        shortcut.prev = shortcut;
-        shortcut.next = shortcut.prev;
-        this.shortcut = shortcut;
-    }
-    dequeue() {
-        const shortcut = this.shortcut;
-        const entry = shortcut.prev;
-        if (entry && entry !== shortcut) {
-            unlink(entry);
-            return entry;
-        }
-    }
-    enqueue(entry) {
-        const shortcut = this.shortcut;
-        if (entry.prev && entry.next) {
-            unlink(entry);
-        }
-        entry.next = shortcut.next;
-        shortcut.next.prev = entry;
-        shortcut.next = entry;
-        entry.prev = shortcut;
-    }
-    toString() {
-        const strs = [];
-        const sentinel = this.shortcut;
-        let curr = sentinel.prev;
-        while (curr !== sentinel) {
-            strs.push(JSON.stringify(curr, filterOutLinks));
-            curr = curr === null || curr === void 0 ? void 0 : curr.prev;
-        }
-        return `[${strs.join(", ")}]`;
-    }
-}
-//# sourceMappingURL=list.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/data/list.ts"],"names":[],"mappings":"AAAA,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE;QAChC,OAAO,CAAC,CAAC;KACV;AACH,CAAC,CAAC;AAOF,MAAM,MAAM,GAAG,CAAI,KAAoB,EAAE,EAAE;IACzC,KAAK,CAAC,IAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IAC9B,KAAK,CAAC,IAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IAC9B,OAAO,KAAK,CAAC,IAAI,CAAC;IAClB,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,OAAO,OAAO,IAAI;IAIvB;QACE,MAAM,QAAQ,GAAoB,EAAE,CAAC;QACrC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC;QACzB,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAEM,OAAO;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC5B,IAAI,KAAK,IAAI,KAAK,KAAK,QAAQ,EAAE;YAC/B,MAAM,CAAC,KAAK,CAAC,CAAC;YACd,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAEM,OAAO,CAAC,KAAoB;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE;YAC5B,MAAM,CAAC,KAAK,CAAC,CAAC;SACf;QACD,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,QAAQ,CAAC,IAAK,CAAC,IAAI,GAAG,KAAK,CAAC;QAC5B,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;IACxB,CAAC;IAEM,QAAQ;QACb,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,KAAK,QAAQ,EAAE;YACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC;SACnB;QACD,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAChC,CAAC;CACF"}

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

@@ -1,3 +0,0 @@
-import { Graph } from "../graph";
-declare const debugOrdering: (g: Graph) => Graph;
-export default debugOrdering;

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

@@ -1,24 +0,0 @@
-import { Graph } from "../graph";
-import { buildLayerMatrix } from "./util";
-const debugOrdering = (g) => {
-    const layerMatrix = 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 === null || layerMatrix === void 0 ? void 0 : layerMatrix.forEach((layer, i) => {
-        const layerV = `layer${i}`;
-        h.setNode(layerV, { rank: "same" });
-        layer === null || layer === void 0 ? void 0 : 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

@@ -1 +0,0 @@
-{"version":3,"file":"debug.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/debug.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,QAAQ,CAAC;AAE1C,MAAM,aAAa,GAAG,CAAC,CAAQ,EAAE,EAAE;IACjC,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAExC,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,CAAE,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,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,aAAX,WAAW,uBAAX,WAAW,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAS,EAAE,EAAE;QACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC;QAC3B,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAA2B,EAAE,CAAC,CAAC;QACzD,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;YACrC,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/greedy-fas.d.ts

@@ -1,3 +0,0 @@
-import { Edge, Graph } from "../graph";
-declare const greedyFAS: (g: Graph, weightFn?: ((e: Edge) => number) | undefined) => (import("@antv/graphlib/lib/Graph").DefaultEdgeType<string, Partial<import("../graph").EdgeConfig & Edge & import("../graph").GraphEdge>> | undefined)[];
-export default greedyFAS;

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

@@ -1,114 +0,0 @@
-import RawList from "./data/list";
-import { Graph as RawGraph } from "@antv/graphlib";
-class List extends RawList {
-}
-class StateGraph extends RawGraph {
-}
-/*
- * 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.
- */
-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);
-    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 = [];
-    (_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) {
-            // this result not really care about in or out
-            results.push({ v: edge.v, w: edge.w, in: 0, out: 0 });
-        }
-        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 collectPredecessors ? results : undefined;
-};
-const buildState = (g, weightFn) => {
-    const fasGraph = new StateGraph();
-    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) || 0;
-        const weight = (weightFn === null || weightFn === void 0 ? void 0 : weightFn(e)) || 1;
-        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

@@ -1 +0,0 @@
-{"version":3,"file":"greedy-fas.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/greedy-fas.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,aAAa,CAAC;AAElC,OAAO,EAAE,KAAK,IAAI,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAUnD,MAAM,IAAK,SAAQ,OAAkB;CAAG;AAExC,MAAM,UAAW,SAAQ,QAAmC;CAAG;AAE/D;;;;;;GAMG;AAEH,MAAM,iBAAiB,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;AAElC,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,QAA8B,EAAE,EAAE;;IAC7D,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,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAEvE,OAAO,MAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,IAAI,EAAE,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,CAAa,EAAE,OAAe,EAAE,OAAe,EAAE,EAAE;IACtE,IAAI,OAAO,GAAgB,EAAE,CAAC;IAC9B,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,EAAE;YAChC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SACxC;QACD,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE;YAClC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SACxC;QACD,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,CACtB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAE,CAC9C,CAAC;oBACF,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CACjB,CAAa,EACb,OAAe,EACf,OAAe,EACf,KAAgB,EAChB,mBAA6B,EAC7B,EAAE;;IACF,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,MAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAE/B,IAAI,mBAAmB,EAAE;YACvB,8CAA8C;YAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;SACvD;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,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAC1B,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,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAQ,EAAE,QAAiC,EAAE,EAAE;IACjE,MAAM,QAAQ,GAAG,IAAI,UAAU,EAAE,CAAC;IAClC,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,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,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,IAAI,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,KAAI,CAAC,CAAC;QAClC,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,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC;QAC/D,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QACjC,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,CAAE,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,OAAe,EAAE,KAAgB,EAAE,EAAE;IAC1E,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;AAEF,eAAe,SAAS,CAAC"}

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

@@ -1,3 +0,0 @@
-import { Graph } from "../graph";
-declare const layout: (g: Graph, opts?: any) => void;
-export default layout;