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

package/lib/node_modules/dagre/lib/acyclic.js

@@ -0,0 +1,80 @@
+import { __require as requireLodash } from './lodash.js';
+import { __require as requireGreedyFas } from './greedy-fas.js';
+
+var acyclic;
+var hasRequiredAcyclic;
+
+function requireAcyclic () {
+	if (hasRequiredAcyclic) return acyclic;
+	hasRequiredAcyclic = 1;
+
+	var _ = requireLodash();
+	var greedyFAS = requireGreedyFas();
+
+	acyclic = {
+	  run: run,
+	  undo: undo
+	};
+
+	function run(g) {
+	  var fas = (g.graph().acyclicer === "greedy"
+	    ? greedyFAS(g, weightFn(g))
+	    : dfsFAS(g));
+	  _.forEach(fas, function(e) {
+	    var label = g.edge(e);
+	    g.removeEdge(e);
+	    label.forwardName = e.name;
+	    label.reversed = true;
+	    g.setEdge(e.w, e.v, label, _.uniqueId("rev"));
+	  });
+
+	  function weightFn(g) {
+	    return function(e) {
+	      return g.edge(e).weight;
+	    };
+	  }
+	}
+
+	function dfsFAS(g) {
+	  var fas = [];
+	  var stack = {};
+	  var visited = {};
+
+	  function dfs(v) {
+	    if (_.has(visited, v)) {
+	      return;
+	    }
+	    visited[v] = true;
+	    stack[v] = true;
+	    _.forEach(g.outEdges(v), function(e) {
+	      if (_.has(stack, e.w)) {
+	        fas.push(e);
+	      } else {
+	        dfs(e.w);
+	      }
+	    });
+	    delete stack[v];
+	  }
+
+	  _.forEach(g.nodes(), dfs);
+	  return fas;
+	}
+
+	function undo(g) {
+	  _.forEach(g.edges(), function(e) {
+	    var label = g.edge(e);
+	    if (label.reversed) {
+	      g.removeEdge(e);
+
+	      var forwardName = label.forwardName;
+	      delete label.reversed;
+	      delete label.forwardName;
+	      g.setEdge(e.w, e.v, label, forwardName);
+	    }
+	  });
+	}
+	return acyclic;
+}
+
+export { requireAcyclic as __require };
+//# sourceMappingURL=acyclic.js.map

package/lib/node_modules/dagre/lib/acyclic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"acyclic.js","sources":["../../../../node_modules/dagre/lib/acyclic.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,SAAS,GAAGC,gBAAA,EAAuB;;AAEvC,CAAA,OAAc,GAAG;GACf,GAAG,EAAE,GAAG;AACV,GAAE,IAAI,EAAE;EACP;;CAED,SAAS,GAAG,CAAC,CAAC,EAAE;GACd,IAAI,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,SAAS,KAAK;AACrC,OAAM,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC9B,OAAM,MAAM,CAAC,CAAC,CAAC,CAAC;GACd,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE;KACzB,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACzB,KAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACnB,KAAI,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI;AAC9B,KAAI,KAAK,CAAC,QAAQ,GAAG,IAAI;KACrB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACjD,GAAA,CAAG,CAAC;;AAEJ,GAAE,SAAS,QAAQ,CAAC,CAAC,EAAE;KACnB,OAAO,SAAS,CAAC,EAAE;OACjB,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;KAC7B,CAAK;AACL,GAAA;AACA,CAAA;;CAEA,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,GAAG,GAAG,EAAE;GACZ,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACrB;AACN,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACrB,KAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;AACnB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OACnC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;AAC7B,SAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACnB,OAAA,CAAO,MAAM;AACb,SAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChB,OAAA;AACA,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,KAAK,CAAC,CAAC,CAAC;AACnB,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC;AAC3B,GAAE,OAAO,GAAG;AACZ,CAAA;;CAEA,SAAS,IAAI,CAAC,CAAC,EAAE;GACf,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACzB,KAAI,IAAI,KAAK,CAAC,QAAQ,EAAE;AACxB,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;;AAErB,OAAM,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW;OACnC,OAAO,KAAK,CAAC,QAAQ;OACrB,OAAO,KAAK,CAAC,WAAW;AAC9B,OAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC;AAC7C,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,52 @@
+import { __require as requireLodash } from './lodash.js';
+import { __require as requireUtil } from './util.js';
+
+var addBorderSegments_1;
+var hasRequiredAddBorderSegments;
+
+function requireAddBorderSegments () {
+	if (hasRequiredAddBorderSegments) return addBorderSegments_1;
+	hasRequiredAddBorderSegments = 1;
+	var _ = requireLodash();
+	var util = requireUtil();
+
+	addBorderSegments_1 = addBorderSegments;
+
+	function addBorderSegments(g) {
+	  function dfs(v) {
+	    var children = g.children(v);
+	    var node = g.node(v);
+	    if (children.length) {
+	      _.forEach(children, dfs);
+	    }
+
+	    if (_.has(node, "minRank")) {
+	      node.borderLeft = [];
+	      node.borderRight = [];
+	      for (var rank = node.minRank, maxRank = node.maxRank + 1;
+	        rank < maxRank;
+	        ++rank) {
+	        addBorderNode(g, "borderLeft", "_bl", v, node, rank);
+	        addBorderNode(g, "borderRight", "_br", v, node, rank);
+	      }
+	    }
+	  }
+
+	  _.forEach(g.children(), dfs);
+	}
+
+	function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
+	  var label = { width: 0, height: 0, rank: rank, borderType: prop };
+	  var prev = sgNode[prop][rank - 1];
+	  var curr = util.addDummyNode(g, "border", label, prefix);
+	  sgNode[prop][rank] = curr;
+	  g.setParent(curr, sg);
+	  if (prev) {
+	    g.setEdge(prev, curr, { weight: 1 });
+	  }
+	}
+	return addBorderSegments_1;
+}
+
+export { requireAddBorderSegments as __require };
+//# sourceMappingURL=add-border-segments.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"add-border-segments.js","sources":["../../../../node_modules/dagre/lib/add-border-segments.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;;AAE5B,CAAA,mBAAc,GAAG,iBAAiB;;CAElC,SAAS,iBAAiB,CAAC,CAAC,EAAE;AAC9B,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;KAC5B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,KAAI,IAAI,QAAQ,CAAC,MAAM,EAAE;AACzB,OAAM,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;AAC9B,KAAA;;KAEI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE;AAChC,OAAM,IAAI,CAAC,UAAU,GAAG,EAAE;AAC1B,OAAM,IAAI,CAAC,WAAW,GAAG,EAAE;AAC3B,OAAM,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC;SACtD,IAAI,GAAG,OAAO;SACd,EAAE,IAAI,EAAE;AAChB,SAAQ,aAAa,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAC5D,SAAQ,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAC7D,OAAA;AACA,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC;AAC9B,CAAA;;AAEA,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;AAC1D,GAAE,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE;GACjE,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACnC,GAAE,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC;GACxD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI;AAC3B,GAAE,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;GACrB,IAAI,IAAI,EAAE;AACZ,KAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AACxC,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,84 @@
+import { __require as requireLodash } from './lodash.js';
+
+var coordinateSystem;
+var hasRequiredCoordinateSystem;
+
+function requireCoordinateSystem () {
+	if (hasRequiredCoordinateSystem) return coordinateSystem;
+	hasRequiredCoordinateSystem = 1;
+
+	var _ = requireLodash();
+
+	coordinateSystem = {
+	  adjust: adjust,
+	  undo: undo
+	};
+
+	function adjust(g) {
+	  var rankDir = g.graph().rankdir.toLowerCase();
+	  if (rankDir === "lr" || rankDir === "rl") {
+	    swapWidthHeight(g);
+	  }
+	}
+
+	function undo(g) {
+	  var rankDir = g.graph().rankdir.toLowerCase();
+	  if (rankDir === "bt" || rankDir === "rl") {
+	    reverseY(g);
+	  }
+
+	  if (rankDir === "lr" || rankDir === "rl") {
+	    swapXY(g);
+	    swapWidthHeight(g);
+	  }
+	}
+
+	function swapWidthHeight(g) {
+	  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });
+	  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });
+	}
+
+	function swapWidthHeightOne(attrs) {
+	  var w = attrs.width;
+	  attrs.width = attrs.height;
+	  attrs.height = w;
+	}
+
+	function reverseY(g) {
+	  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });
+
+	  _.forEach(g.edges(), function(e) {
+	    var edge = g.edge(e);
+	    _.forEach(edge.points, reverseYOne);
+	    if (_.has(edge, "y")) {
+	      reverseYOne(edge);
+	    }
+	  });
+	}
+
+	function reverseYOne(attrs) {
+	  attrs.y = -attrs.y;
+	}
+
+	function swapXY(g) {
+	  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });
+
+	  _.forEach(g.edges(), function(e) {
+	    var edge = g.edge(e);
+	    _.forEach(edge.points, swapXYOne);
+	    if (_.has(edge, "x")) {
+	      swapXYOne(edge);
+	    }
+	  });
+	}
+
+	function swapXYOne(attrs) {
+	  var x = attrs.x;
+	  attrs.x = attrs.y;
+	  attrs.y = x;
+	}
+	return coordinateSystem;
+}
+
+export { requireCoordinateSystem as __require };
+//# sourceMappingURL=coordinate-system.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-system.js","sources":["../../../../node_modules/dagre/lib/coordinate-system.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;;AAE3B,CAAA,gBAAc,GAAG;GACf,MAAM,EAAE,MAAM;AAChB,GAAE,IAAI,EAAE;EACP;;CAED,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE;GAC7C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,eAAe,CAAC,CAAC,CAAC;AACtB,GAAA;AACA,CAAA;;CAEA,SAAS,IAAI,CAAC,CAAC,EAAE;GACf,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE;GAC7C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,QAAQ,CAAC,CAAC,CAAC;AACf,GAAA;;GAEE,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,MAAM,CAAC,CAAC,CAAC;KACT,eAAe,CAAC,CAAC,CAAC;AACtB,GAAA;AACA,CAAA;;CAEA,SAAS,eAAe,CAAC,CAAC,EAAE;GAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;GACpE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACtE,CAAA;;CAEA,SAAS,kBAAkB,CAAC,KAAK,EAAE;AACnC,GAAE,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK;AACrB,GAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM;AAC5B,GAAE,KAAK,CAAC,MAAM,GAAG,CAAC;AAClB,CAAA;;CAEA,SAAS,QAAQ,CAAC,CAAC,EAAE;GACnB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;;GAE7D,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC;KACnC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;OACpB,WAAW,CAAC,IAAI,CAAC;AACvB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,WAAW,CAAC,KAAK,EAAE;AAC5B,GAAE,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AACpB,CAAA;;CAEA,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;;GAE3D,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC;KACjC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;OACpB,SAAS,CAAC,IAAI,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,GAAE,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACjB,GAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AACnB,GAAE,KAAK,CAAC,CAAC,GAAG,CAAC;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/data/list.js

@@ -0,0 +1,67 @@
+/*
+ * Simple doubly linked list implementation derived from Cormen, et al.,
+ * "Introduction to Algorithms".
+ */
+
+var list;
+var hasRequiredList;
+
+function requireList () {
+	if (hasRequiredList) return list;
+	hasRequiredList = 1;
+	list = List;
+
+	function List() {
+	  var sentinel = {};
+	  sentinel._next = sentinel._prev = sentinel;
+	  this._sentinel = sentinel;
+	}
+
+	List.prototype.dequeue = function() {
+	  var sentinel = this._sentinel;
+	  var entry = sentinel._prev;
+	  if (entry !== sentinel) {
+	    unlink(entry);
+	    return entry;
+	  }
+	};
+
+	List.prototype.enqueue = function(entry) {
+	  var sentinel = this._sentinel;
+	  if (entry._prev && entry._next) {
+	    unlink(entry);
+	  }
+	  entry._next = sentinel._next;
+	  sentinel._next._prev = entry;
+	  sentinel._next = entry;
+	  entry._prev = sentinel;
+	};
+
+	List.prototype.toString = function() {
+	  var strs = [];
+	  var sentinel = this._sentinel;
+	  var curr = sentinel._prev;
+	  while (curr !== sentinel) {
+	    strs.push(JSON.stringify(curr, filterOutLinks));
+	    curr = curr._prev;
+	  }
+	  return "[" + strs.join(", ") + "]";
+	};
+
+	function unlink(entry) {
+	  entry._prev._next = entry._next;
+	  entry._next._prev = entry._prev;
+	  delete entry._next;
+	  delete entry._prev;
+	}
+
+	function filterOutLinks(k, v) {
+	  if (k !== "_next" && k !== "_prev") {
+	    return v;
+	  }
+	}
+	return list;
+}
+
+export { requireList as __require };
+//# sourceMappingURL=list.js.map

package/lib/node_modules/dagre/lib/data/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sources":["../../../../../node_modules/dagre/lib/data/list.js"],"sourcesContent":["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAKA,CAAA,IAAc,GAAG,IAAI;;AAErB,CAAA,SAAS,IAAI,GAAG;GACd,IAAI,QAAQ,GAAG,EAAE;GACjB,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,GAAG,QAAQ;AAC5C,GAAE,IAAI,CAAC,SAAS,GAAG,QAAQ;AAC3B,CAAA;;AAEA,CAAA,IAAI,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;AACpC,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;AAC/B,GAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK;AAC5B,GAAE,IAAI,KAAK,KAAK,QAAQ,EAAE;KACtB,MAAM,CAAC,KAAK,CAAC;AACjB,KAAI,OAAO,KAAK;AAChB,GAAA;CACA,CAAC;;AAED,CAAA,IAAI,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,KAAK,EAAE;AACzC,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;GAC7B,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;KAC9B,MAAM,CAAC,KAAK,CAAC;AACjB,GAAA;AACA,GAAE,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK;AAC9B,GAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK;AAC9B,GAAE,QAAQ,CAAC,KAAK,GAAG,KAAK;AACxB,GAAE,KAAK,CAAC,KAAK,GAAG,QAAQ;CACxB,CAAC;;AAED,CAAA,IAAI,CAAC,SAAS,CAAC,QAAQ,GAAG,WAAW;GACnC,IAAI,IAAI,GAAG,EAAE;AACf,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;AAC/B,GAAE,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK;AAC3B,GAAE,OAAO,IAAI,KAAK,QAAQ,EAAE;AAC5B,KAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;AACnD,KAAI,IAAI,GAAG,IAAI,CAAC,KAAK;AACrB,GAAA;GACE,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG;CACpC,CAAC;;CAED,SAAS,MAAM,CAAC,KAAK,EAAE;GACrB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;GAC/B,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;GAC/B,OAAO,KAAK,CAAC,KAAK;GAClB,OAAO,KAAK,CAAC,KAAK;AACpB,CAAA;;AAEA,CAAA,SAAS,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE;GAC5B,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,OAAO,EAAE;AACtC,KAAI,OAAO,CAAC;AACZ,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/debug.js

@@ -0,0 +1,49 @@
+import { __require as requireLodash } from './lodash.js';
+import { __require as requireUtil } from './util.js';
+import { __require as requireGraphlib } from './graphlib.js';
+
+var debug;
+var hasRequiredDebug;
+
+function requireDebug () {
+	if (hasRequiredDebug) return debug;
+	hasRequiredDebug = 1;
+	var _ = requireLodash();
+	var util = requireUtil();
+	var Graph = requireGraphlib().Graph;
+
+	debug = {
+	  debugOrdering: debugOrdering
+	};
+
+	/* istanbul ignore next */
+	function debugOrdering(g) {
+	  var layerMatrix = util.buildLayerMatrix(g);
+
+	  var h = new Graph({ compound: true, multigraph: true }).setGraph({});
+
+	  _.forEach(g.nodes(), function(v) {
+	    h.setNode(v, { label: v });
+	    h.setParent(v, "layer" + g.node(v).rank);
+	  });
+
+	  _.forEach(g.edges(), function(e) {
+	    h.setEdge(e.v, e.w, {}, e.name);
+	  });
+
+	  _.forEach(layerMatrix, function(layer, i) {
+	    var layerV = "layer" + i;
+	    h.setNode(layerV, { rank: "same" });
+	    _.reduce(layer, function(u, v) {
+	      h.setEdge(u, v, { style: "invis" });
+	      return v;
+	    });
+	  });
+
+	  return h;
+	}
+	return debug;
+}
+
+export { requireDebug as __require };
+//# sourceMappingURL=debug.js.map

package/lib/node_modules/dagre/lib/debug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","sources":["../../../../node_modules/dagre/lib/debug.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;AAC5B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;;AAEvC,CAAA,KAAc,GAAG;AACjB,GAAE,aAAa,EAAE;EAChB;;AAED;CACA,SAAS,aAAa,CAAC,CAAC,EAAE;GACxB,IAAI,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;;GAE1C,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;;GAEpE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAC9B,KAAI,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5C,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;AACnC,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE;AAC5C,KAAI,IAAI,MAAM,GAAG,OAAO,GAAG,CAAC;KACxB,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;KACnC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;AACnC,OAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACzC,OAAM,OAAO,CAAC;AACd,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,CAAC;AACV,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/graphlib.js

@@ -0,0 +1,31 @@
+import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';
+import { __require as requireGraphlib$1 } from '../../graphlib/index.js';
+
+/* global window */
+
+var graphlib_1;
+var hasRequiredGraphlib;
+
+function requireGraphlib () {
+	if (hasRequiredGraphlib) return graphlib_1;
+	hasRequiredGraphlib = 1;
+	var graphlib;
+
+	if (typeof commonjsRequire === "function") {
+	  try {
+	    graphlib = requireGraphlib$1();
+	  } catch (e) {
+	    // continue regardless of error
+	  }
+	}
+
+	if (!graphlib) {
+	  graphlib = window.graphlib;
+	}
+
+	graphlib_1 = graphlib;
+	return graphlib_1;
+}
+
+export { requireGraphlib as __require };
+//# sourceMappingURL=graphlib.js.map

package/lib/node_modules/dagre/lib/graphlib.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphlib.js","sources":["../../../../node_modules/dagre/lib/graphlib.js"],"sourcesContent":["/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n"],"names":["require","require$$0"],"mappings":";;;;;;;;;;;AAEA,CAAA,IAAI,QAAQ;;AAEZ,CAAA,IAAI,OAAOA,eAAO,KAAK,UAAU,EAAE;AACnC,GAAE,IAAI;KACF,QAAQ,GAAGC,iBAAA,EAAmB;GAClC,CAAG,CAAC,OAAO,CAAC,EAAE;AACd;AACA,GAAA;AACA,CAAA;;CAEA,IAAI,CAAC,QAAQ,EAAE;AACf,GAAE,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAC5B,CAAA;;AAEA,CAAA,UAAc,GAAG,QAAQ;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,133 @@
+import { __require as requireLodash } from './lodash.js';
+import { __require as requireGraphlib } from './graphlib.js';
+import { __require as requireList } from './data/list.js';
+
+var greedyFas;
+var hasRequiredGreedyFas;
+
+function requireGreedyFas () {
+	if (hasRequiredGreedyFas) return greedyFas;
+	hasRequiredGreedyFas = 1;
+	var _ = requireLodash();
+	var Graph = requireGraphlib().Graph;
+	var List = requireList();
+
+	/*
+	 * 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.
+	 */
+	greedyFas = greedyFAS;
+
+	var DEFAULT_WEIGHT_FN = _.constant(1);
+
+	function greedyFAS(g, weightFn) {
+	  if (g.nodeCount() <= 1) {
+	    return [];
+	  }
+	  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+	  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
+
+	  // Expand multi-edges
+	  return _.flatten(_.map(results, function(e) {
+	    return g.outEdges(e.v, e.w);
+	  }), true);
+	}
+
+	function doGreedyFAS(g, buckets, zeroIdx) {
+	  var results = [];
+	  var sources = buckets[buckets.length - 1];
+	  var sinks = buckets[0];
+
+	  var entry;
+	  while (g.nodeCount()) {
+	    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }
+	    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
+	    if (g.nodeCount()) {
+	      for (var i = buckets.length - 2; i > 0; --i) {
+	        entry = buckets[i].dequeue();
+	        if (entry) {
+	          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+	          break;
+	        }
+	      }
+	    }
+	  }
+
+	  return results;
+	}
+
+	function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
+	  var results = collectPredecessors ? [] : undefined;
+
+	  _.forEach(g.inEdges(entry.v), function(edge) {
+	    var weight = g.edge(edge);
+	    var uEntry = g.node(edge.v);
+
+	    if (collectPredecessors) {
+	      results.push({ v: edge.v, w: edge.w });
+	    }
+
+	    uEntry.out -= weight;
+	    assignBucket(buckets, zeroIdx, uEntry);
+	  });
+
+	  _.forEach(g.outEdges(entry.v), function(edge) {
+	    var weight = g.edge(edge);
+	    var w = edge.w;
+	    var wEntry = g.node(w);
+	    wEntry["in"] -= weight;
+	    assignBucket(buckets, zeroIdx, wEntry);
+	  });
+
+	  g.removeNode(entry.v);
+
+	  return results;
+	}
+
+	function buildState(g, weightFn) {
+	  var fasGraph = new Graph();
+	  var maxIn = 0;
+	  var maxOut = 0;
+
+	  _.forEach(g.nodes(), function(v) {
+	    fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
+	  });
+
+	  // Aggregate weights on nodes, but also sum the weights across multi-edges
+	  // into a single edge for the fasGraph.
+	  _.forEach(g.edges(), function(e) {
+	    var prevWeight = fasGraph.edge(e.v, e.w) || 0;
+	    var weight = weightFn(e);
+	    var edgeWeight = prevWeight + weight;
+	    fasGraph.setEdge(e.v, e.w, edgeWeight);
+	    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
+	    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)["in"]  += weight);
+	  });
+
+	  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });
+	  var zeroIdx = maxIn + 1;
+
+	  _.forEach(fasGraph.nodes(), function(v) {
+	    assignBucket(buckets, zeroIdx, fasGraph.node(v));
+	  });
+
+	  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
+	}
+
+	function 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);
+	  }
+	}
+	return greedyFas;
+}
+
+export { requireGreedyFas as __require };
+//# sourceMappingURL=greedy-fas.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sources":["../../../../node_modules/dagre/lib/greedy-fas.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;AAC3B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;CACvC,IAAI,IAAI,GAAGC,WAAA,EAAsB;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAc,GAAG,SAAS;;AAE1B,CAAA,IAAI,iBAAiB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;AAErC,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE;AAChC,GAAE,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;AAC1B,KAAI,OAAO,EAAE;AACb,GAAA;GACE,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC;AAC1D,GAAE,IAAI,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;;AAEtE;AACA,GAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE;AAC9C,KAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;GAC/B,CAAG,CAAC,EAAE,IAAI,CAAC;AACX,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE;GACxC,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC3C,GAAE,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;;AAExB,GAAE,IAAI,KAAK;AACX,GAAE,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;AACxB,KAAI,QAAQ,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AACjF,KAAI,QAAQ,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AACjF,KAAI,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE;AACvB,OAAM,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;SAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;SAC5B,IAAI,KAAK,EAAE;AACnB,WAAU,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;WACtE;AACV,SAAA;AACA,OAAA;AACA,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,mBAAmB,EAAE;AACrE,GAAE,IAAI,OAAO,GAAG,mBAAmB,GAAG,EAAE,GAAG,SAAS;;AAEpD,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KAC3C,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;KACzB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;;KAE3B,IAAI,mBAAmB,EAAE;AAC7B,OAAM,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AAC5C,KAAA;;AAEA,KAAI,MAAM,CAAC,GAAG,IAAI,MAAM;AACxB,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC;AAC1C,GAAA,CAAG,CAAC;;AAEJ,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KAC5C,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;KACd,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1B,KAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM;AAC1B,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC;AAC1C,GAAA,CAAG,CAAC;;AAEJ,GAAE,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;;AAEvB,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE;AACjC,GAAE,IAAI,QAAQ,GAAG,IAAI,KAAK,EAAE;GAC1B,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,MAAM,GAAG,CAAC;;GAEd,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAClD,GAAA,CAAG,CAAC;;AAEJ;AACA;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,IAAI,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,KAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC5B,KAAI,IAAI,UAAU,GAAG,UAAU,GAAG,MAAM;AACxC,KAAI,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;KACtC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC;KAC3D,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AAClE,GAAA,CAAG,CAAC;;GAEF,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,IAAI,IAAI,EAAE,CAAC,CAAA,CAAE,CAAC;AAClF,GAAE,IAAI,OAAO,GAAG,KAAK,GAAG,CAAC;;GAEvB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AAC1C,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpD,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE;AAChE,CAAA;;AAEA,CAAA,SAAS,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE;AAC/C,GAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;KACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7B,GAAA,CAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC3B,KAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC9C,GAAA,CAAG,MAAM;AACT,KAAI,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7D,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}