@antv/layout 1.2.14-beta.9 → 2.0.0-alpha.2

package/lib/antv-dagre/acyclic.d.ts

@@ -1,4 +0,0 @@
-import { Graph } from '../types';
-declare const run: (g: Graph, acyclicer: string) => void;
-declare const undo: (g: Graph) => void;
-export { run, undo };

package/lib/antv-dagre/acyclic.js

@@ -1,61 +0,0 @@
-import { greedyFAS } from './greedy-fas';
-const run = (g, acyclicer) => {
-    const weightFn = (g) => {
-        return (e) => e.data.weight || 1;
-    };
-    const fas = acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);
-    fas === null || fas === void 0 ? void 0 : fas.forEach((e) => {
-        const label = e.data;
-        g.removeEdge(e.id);
-        label.forwardName = e.data.name;
-        label.reversed = true;
-        g.addEdge({
-            id: e.id,
-            source: e.target,
-            target: e.source,
-            data: Object.assign({}, label),
-        });
-    });
-};
-const dfsFAS = (g) => {
-    const fas = [];
-    const stack = {};
-    const visited = {};
-    const dfs = (v) => {
-        if (visited[v]) {
-            return;
-        }
-        visited[v] = true;
-        stack[v] = true;
-        g.getRelatedEdges(v, 'out').forEach((e) => {
-            if (stack[e.target]) {
-                fas.push(e);
-            }
-            else {
-                dfs(e.target);
-            }
-        });
-        delete stack[v];
-    };
-    g.getAllNodes().forEach((n) => dfs(n.id));
-    return fas;
-};
-const undo = (g) => {
-    g.getAllEdges().forEach((e) => {
-        const label = e.data;
-        if (label.reversed) {
-            g.removeEdge(e.id);
-            const forwardName = label.forwardName;
-            delete label.reversed;
-            delete label.forwardName;
-            g.addEdge({
-                id: e.id,
-                source: e.target,
-                target: e.source,
-                data: Object.assign(Object.assign({}, label), { forwardName }),
-            });
-        }
-    });
-};
-export { run, undo };
-//# sourceMappingURL=acyclic.js.map

package/lib/antv-dagre/acyclic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"acyclic.js","sourceRoot":"","sources":["../../src/antv-dagre/acyclic.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAEzC,MAAM,GAAG,GAAG,CAAC,CAAQ,EAAE,SAAiB,EAAE,EAAE;IAC1C,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,EAAE;QAC5B,OAAO,CAAC,CAAiB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3E,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,OAAO,CAAC,CAAC,CAAiB,EAAE,EAAE;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;QACrB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAChC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,IAAI,oBACC,KAAK,CACT;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1B,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,MAAM,OAAO,GAAwB,EAAE,CAAC;IAExC,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;QACpB,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO;SACR;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAChB,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACxC,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE;gBACnB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACb;iBAAM;gBACL,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;aACf;QACH,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,CAAC,QAAQ,EAAE;YAClB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAEnB,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;YACtC,OAAO,KAAK,CAAC,QAAQ,CAAC;YACtB,OAAO,KAAK,CAAC,WAAW,CAAC;YACzB,CAAC,CAAC,OAAO,CAAC;gBACR,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,IAAI,kCAAO,KAAK,KAAE,WAAW,GAAE;aAChC,CAAC,CAAC;SACJ;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC"}

package/lib/antv-dagre/add-border-segments.d.ts

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

package/lib/antv-dagre/add-border-segments.js

@@ -1,37 +0,0 @@
-import { addDummyNode } from './util';
-export const addBorderSegments = (g) => {
-    const dfs = (v) => {
-        const children = g.getChildren(v);
-        const node = g.getNode(v);
-        if (children === null || children === void 0 ? void 0 : children.length) {
-            children.forEach((child) => dfs(child.id));
-        }
-        if (node.data.hasOwnProperty('minRank')) {
-            node.data.borderLeft = [];
-            node.data.borderRight = [];
-            for (let rank = node.data.minRank, maxRank = node.data.maxRank + 1; rank < maxRank; rank += 1) {
-                addBorderNode(g, 'borderLeft', '_bl', v, node, rank);
-                addBorderNode(g, 'borderRight', '_br', v, node, rank);
-            }
-        }
-    };
-    g.getRoots().forEach((child) => dfs(child.id));
-};
-const addBorderNode = (g, prop, prefix, sg, sgNode, rank) => {
-    const label = { rank, borderType: prop, width: 0, height: 0 };
-    // @ts-ignore
-    const prev = sgNode.data[prop][rank - 1];
-    const curr = addDummyNode(g, 'border', label, prefix);
-    // @ts-ignore
-    sgNode.data[prop][rank] = curr;
-    g.setParent(curr, sg);
-    if (prev) {
-        g.addEdge({
-            id: `e${Math.random()}`,
-            source: prev,
-            target: curr,
-            data: { weight: 1 },
-        });
-    }
-};
-//# sourceMappingURL=add-border-segments.js.map

package/lib/antv-dagre/add-border-segments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-border-segments.js","sourceRoot":"","sources":["../../src/antv-dagre/add-border-segments.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAEtC,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC5C,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;QACpB,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;YACpB,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;SAC5C;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YAC3B,KACE,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAQ,EAAE,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAQ,GAAG,CAAC,EAC/D,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,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CACpB,CAAQ,EACR,IAAY,EACZ,MAAc,EACd,EAAM,EACN,MAAsB,EACtB,IAAY,EACZ,EAAE;IACF,MAAM,KAAK,GAAa,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACxE,aAAa;IACb,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtD,aAAa;IACb,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAC/B,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtB,IAAI,IAAI,EAAE;QACR,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACvB,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,IAAI;YACZ,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;SACpB,CAAC,CAAC;KACJ;AACH,CAAC,CAAC"}

package/lib/antv-dagre/coordinate-system.d.ts

@@ -1,5 +0,0 @@
-import type { Graph } from '../types';
-import type { DagreRankdir } from './types';
-declare const adjust: (g: Graph, rankdir: DagreRankdir) => void;
-declare const undo: (g: Graph, rankdir: DagreRankdir) => void;
-export { adjust, undo };

package/lib/antv-dagre/coordinate-system.js

@@ -1,65 +0,0 @@
-const adjust = (g, rankdir) => {
-    const rd = rankdir.toLowerCase();
-    if (rd === 'lr' || rd === 'rl') {
-        swapWidthHeight(g);
-    }
-};
-const undo = (g, rankdir) => {
-    const rd = rankdir.toLowerCase();
-    if (rd === 'bt' || rd === 'rl') {
-        reverseY(g);
-    }
-    if (rd === 'lr' || rd === 'rl') {
-        swapXY(g);
-        swapWidthHeight(g);
-    }
-};
-const swapWidthHeight = (g) => {
-    g.getAllNodes().forEach((v) => {
-        swapWidthHeightOne(v);
-    });
-    g.getAllEdges().forEach((e) => {
-        swapWidthHeightOne(e);
-    });
-};
-const swapWidthHeightOne = (node) => {
-    const w = node.data.width;
-    node.data.width = node.data.height;
-    node.data.height = w;
-};
-const reverseY = (g) => {
-    g.getAllNodes().forEach((v) => {
-        reverseYOne(v.data);
-    });
-    g.getAllEdges().forEach((edge) => {
-        var _a;
-        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => reverseYOne(point));
-        if (edge.data.hasOwnProperty('y')) {
-            reverseYOne(edge.data);
-        }
-    });
-};
-const reverseYOne = (node) => {
-    if (node === null || node === void 0 ? void 0 : node.y) {
-        node.y = -node.y;
-    }
-};
-const swapXY = (g) => {
-    g.getAllNodes().forEach((v) => {
-        swapXYOne(v.data);
-    });
-    g.getAllEdges().forEach((edge) => {
-        var _a;
-        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => swapXYOne(point));
-        if (edge.data.hasOwnProperty('x')) {
-            swapXYOne(edge.data);
-        }
-    });
-};
-const swapXYOne = (node) => {
-    const x = node.x;
-    node.x = node.y;
-    node.y = x;
-};
-export { adjust, undo };
-//# sourceMappingURL=coordinate-system.js.map

package/lib/antv-dagre/coordinate-system.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coordinate-system.js","sourceRoot":"","sources":["../../src/antv-dagre/coordinate-system.ts"],"names":[],"mappings":"AAIA,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,OAAqB,EAAE,EAAE;IACjD,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE;QAC9B,eAAe,CAAC,CAAC,CAAC,CAAC;KACpB;AACH,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,OAAqB,EAAE,EAAE;IAC/C,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE;QAC9B,QAAQ,CAAC,CAAC,CAAC,CAAC;KACb;IAED,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE;QAC9B,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,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,kBAAkB,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,kBAAkB,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,IAAoB,EAAE,EAAE;IAClD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACnC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC5B,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;QAC/B,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACjC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,IAAS,EAAE,EAAE;IAChC,IAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,CAAC,EAAE;QACX,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;KAClB;AACH,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1B,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;QAC/B,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACjC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,IAAS,EAAE,EAAE;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACb,CAAC,CAAC;AAEF,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC"}

package/lib/antv-dagre/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>;
-    enqueue(entry: LinkedNode<T>): void;
-    toString(): string;
-}
-export {};

package/lib/antv-dagre/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/lib/antv-dagre/data/list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../../src/antv-dagre/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/lib/antv-dagre/greedy-fas.d.ts

@@ -1,3 +0,0 @@
-import { Edge } from '@antv/graphlib';
-import { EdgeData, Graph as IGraph } from '../types';
-export declare const greedyFAS: (g: IGraph, weightFn?: (e: Edge<EdgeData>) => number) => Edge<EdgeData>[];

package/lib/antv-dagre/greedy-fas.js

@@ -1,136 +0,0 @@
-/*
- * 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.
- *
- * @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js
- */
-import { Graph } from '@antv/graphlib';
-import RawList from './data/list';
-class List extends RawList {
-}
-const DEFAULT_WEIGHT_FN = () => 1;
-export const greedyFAS = (g, weightFn) => {
-    var _a;
-    if (g.getAllNodes().length <= 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.getRelatedEdges(e.v, 'out').filter(({ target }) => target === 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.getAllNodes().length) {
-        while ((entry = sinks.dequeue())) {
-            removeNode(g, buckets, zeroIdx, entry);
-        }
-        while ((entry = sources.dequeue())) {
-            removeNode(g, buckets, zeroIdx, entry);
-        }
-        if (g.getAllNodes().length) {
-            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 = [];
-    if (g.hasNode(entry.v)) {
-        (_a = g.getRelatedEdges(entry.v, 'in')) === null || _a === void 0 ? void 0 : _a.forEach((edge) => {
-            const weight = edge.data.weight;
-            const uEntry = g.getNode(edge.source);
-            if (collectPredecessors) {
-                // this result not really care about in or out
-                results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });
-            }
-            if (uEntry.data.out === undefined)
-                uEntry.data.out = 0;
-            // @ts-ignore
-            uEntry.data.out -= weight;
-            assignBucket(buckets, zeroIdx, Object.assign({ v: uEntry.id }, uEntry.data));
-        });
-        (_b = g.getRelatedEdges(entry.v, 'out')) === null || _b === void 0 ? void 0 : _b.forEach((edge) => {
-            const weight = edge.data.weight;
-            const w = edge.target;
-            const wEntry = g.getNode(w);
-            if (wEntry.data.in === undefined)
-                wEntry.data.in = 0;
-            // @ts-ignore
-            wEntry.data.in -= weight;
-            assignBucket(buckets, zeroIdx, Object.assign({ v: wEntry.id }, wEntry.data));
-        });
-        g.removeNode(entry.v);
-    }
-    return collectPredecessors ? results : undefined;
-};
-const buildState = (g, weightFn) => {
-    const fasGraph = new Graph();
-    let maxIn = 0;
-    let maxOut = 0;
-    g.getAllNodes().forEach((v) => {
-        fasGraph.addNode({
-            id: v.id,
-            data: { v: v.id, in: 0, out: 0 },
-        });
-    });
-    // Aggregate weights on nodes, but also sum the weights across multi-edges
-    // into a single edge for the fasGraph.
-    g.getAllEdges().forEach((e) => {
-        const edge = fasGraph
-            .getRelatedEdges(e.source, 'out')
-            .find((edge) => edge.target === e.target);
-        const weight = (weightFn === null || weightFn === void 0 ? void 0 : weightFn(e)) || 1;
-        if (!edge) {
-            fasGraph.addEdge({
-                id: e.id,
-                source: e.source,
-                target: e.target,
-                data: {
-                    weight,
-                },
-            });
-        }
-        else {
-            fasGraph.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + weight }));
-        }
-        // @ts-ignore
-        maxOut = Math.max(maxOut, (fasGraph.getNode(e.source).data.out += weight));
-        // @ts-ignore
-        maxIn = Math.max(maxIn, (fasGraph.getNode(e.target).data.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.getAllNodes().forEach((v) => {
-        assignBucket(buckets, zeroIdx, Object.assign({ v: v.id }, fasGraph.getNode(v.id).data));
-    });
-    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);
-    }
-};
-//# sourceMappingURL=greedy-fas.js.map

package/lib/antv-dagre/greedy-fas.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"greedy-fas.js","sourceRoot":"","sources":["../../src/antv-dagre/greedy-fas.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAQ,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAEjD,OAAO,OAAO,MAAM,aAAa,CAAC;AAUlC,MAAM,IAAK,SAAQ,OAAkB;CAAG;AAExC,MAAM,iBAAiB,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;AAElC,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,CAAS,EACT,QAAwC,EACxC,EAAE;;IACF,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3C,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;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACT,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CACrE,0CACC,IAAI,EAAE,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,OAAe,EAAE,OAAe,EAAE,EAAE;IAClE,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,WAAW,EAAE,CAAC,MAAM,EAAE;QAC7B,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,WAAW,EAAE,CAAC,MAAM,EAAE;YAC1B,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,CAAS,EACT,OAAe,EACf,OAAe,EACf,KAAgB,EAChB,mBAA6B,EAC7B,EAAE;;IACF,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QACtB,MAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC;YAEvC,IAAI,mBAAmB,EAAE;gBACvB,8CAA8C;gBAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aACjE;YACD,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACvD,aAAa;YACb,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC;YAC1B,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,IACT,MAAM,CAAC,IAAI,CACF,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,MAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACrD,aAAa;YACb,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC;YACzB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,IACT,MAAM,CAAC,IAAI,CACF,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KACvB;IAED,OAAO,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,QAAwC,EAAE,EAAE;IACzE,MAAM,QAAQ,GAAG,IAAI,KAAK,EAAsB,CAAC;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,QAAQ,CAAC,OAAO,CAAC;YACf,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;SACjC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,uCAAuC;IACvC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,GAAG,QAAQ;aAClB,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;aAChC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,KAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE;YACT,QAAQ,CAAC,OAAO,CAAC;gBACf,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,IAAI,EAAE;oBACJ,MAAM;iBACP;aACF,CAAC,CAAC;SACJ;aAAM;YACL,QAAQ,CAAC,cAAc,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAG,kCAC5B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM,IAClC,CAAC;SACJ;QACD,aAAa;QACb,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC;QAC5E,aAAa;QACb,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;IAC3E,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,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,gBAC7B,CAAC,EAAE,CAAC,CAAC,EAAE,IACJ,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAClB,CAAC,CAAC;IAClB,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"}

package/lib/antv-dagre/layout.d.ts

@@ -1,19 +0,0 @@
-import { ID } from '@antv/graphlib';
-import { Graph as IGraph } from '../types';
-import type { DagreAlign, DagreRankdir } from './types';
-export declare const layout: (g: IGraph, options: {
-    keepNodeOrder: boolean;
-    prevGraph: IGraph | null;
-    edgeLabelSpace?: boolean;
-    align?: DagreAlign;
-    nodesep?: number;
-    edgesep?: number;
-    ranksep?: number;
-    acyclicer: string;
-    nodeOrder: ID[];
-    ranker: 'network-simplex' | 'tight-tree' | 'longest-path';
-    rankdir: DagreRankdir;
-}) => {
-    width: number;
-    height: number;
-};