@antv/layout 2.0.0-beta.2 → 2.0.1

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

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sources":["../../../../node_modules/dagre/lib/util.js"],"sourcesContent":["/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n"],"names":["require$$0","require$$1","util"],"mappings":";;;;;;;;;;;;CAIA,IAAI,CAAC,GAAGA,aAAA,EAAmB;AAC3B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;;AAEvC,CAAAC,MAAc,GAAG;GACf,YAAY,EAAE,YAAY;GAC1B,QAAQ,EAAE,QAAQ;GAClB,kBAAkB,EAAE,kBAAkB;GACtC,gBAAgB,EAAE,gBAAgB;GAClC,kBAAkB,EAAE,kBAAkB;GACtC,aAAa,EAAE,aAAa;GAC5B,gBAAgB,EAAE,gBAAgB;GAClC,cAAc,EAAE,cAAc;GAC9B,gBAAgB,EAAE,gBAAgB;GAClC,aAAa,EAAE,aAAa;GAC5B,OAAO,EAAE,OAAO;GAChB,SAAS,EAAE,SAAS;GACpB,IAAI,EAAE,IAAI;AACZ,GAAE,MAAM,EAAE;EACT;;AAED;AACA;AACA;CACA,SAAS,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;AAC5C,GAAE,IAAI,CAAC;AACP,GAAE,GAAG;AACL,KAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;AACxB,GAAA,CAAG,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;;AAEvB,GAAE,KAAK,CAAC,KAAK,GAAG,IAAI;AACpB,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AACrB,GAAE,OAAO,CAAC;AACV,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,QAAQ,CAAC,CAAC,EAAE;AACrB,GAAE,IAAI,UAAU,GAAG,IAAI,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;AAClD,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;GACvE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;KACvE,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACrB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;OAC3B,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;AAC/C,OAAM,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM;AACvD,MAAK,CAAC;AACN,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,UAAU;AACnB,CAAA;;CAEA,SAAS,kBAAkB,CAAC,CAAC,EAAE;GAC7B,IAAI,UAAU,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;GAChF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAC/B,OAAM,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtC,KAAA;AACA,GAAA,CAAG,CAAC;GACF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpC,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,UAAU;AACnB,CAAA;;CAEA,SAAS,gBAAgB,CAAC,CAAC,EAAE;AAC7B,GAAE,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC3C,IAAI,IAAI,GAAG,EAAE;AACjB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OACnC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AACrD,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,IAAI;AACf,GAAA,CAAG,CAAC;GACF,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC;AAC1C,CAAA;;CAEA,SAAS,kBAAkB,CAAC,CAAC,EAAE;AAC/B,GAAE,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC3C,IAAI,KAAK,GAAG,EAAE;AAClB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OAClC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AACvD,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,KAAK;AAChB,GAAA,CAAG,CAAC;GACF,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC;AAC1C,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE;AACpC,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAChB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;;AAEhB;AACA;AACA,GAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC;AACtB,GAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC;AACtB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC;AACxB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;;AAEzB,GAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;AAClB,KAAI,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC;AAChF,GAAA;;GAEE,IAAI,EAAE,EAAE,EAAE;AACZ,GAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;AAC3C;AACA,KAAI,IAAI,EAAE,GAAG,CAAC,EAAE;OACV,CAAC,GAAG,CAAC,CAAC;AACZ,KAAA;AACA,KAAI,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE;KAChB,EAAE,GAAG,CAAC;AACV,GAAA,CAAG,MAAM;AACT;AACA,KAAI,IAAI,EAAE,GAAG,CAAC,EAAE;OACV,CAAC,GAAG,CAAC,CAAC;AACZ,KAAA;KACI,EAAE,GAAG,CAAC;AACV,KAAI,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE;AACpB,GAAA;;AAEA,GAAE,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AACjC,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,gBAAgB,CAAC,CAAC,EAAE;GAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAA,CAAE,CAAC;GACxE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,KAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;KACpB,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;OACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,QAAQ;AACjB,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,cAAc,CAAC,CAAC,EAAE;AAC3B,GAAE,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC,CAAC;GACzE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE;AAC7B,OAAM,IAAI,CAAC,IAAI,IAAI,GAAG;AACtB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,gBAAgB,CAAC,CAAC,EAAE;AAC7B;AACA,GAAE,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC,CAAC;;GAE5E,IAAI,MAAM,GAAG,EAAE;GACf,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,MAAM;AACtC,KAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AACvB,OAAM,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;AACvB,KAAA;KACI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,GAAA,CAAG,CAAC;;GAEF,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,cAAc,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc;GAC7C,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE;AACpC,KAAI,IAAI,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;AACvD,OAAM,EAAE,KAAK;KACb,CAAK,MAAM,IAAI,KAAK,EAAE;OAChB,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,CAAA,CAAE,CAAC;AAC7D,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE;GAC7C,IAAI,IAAI,GAAG;KACT,KAAK,EAAE,CAAC;AACZ,KAAI,MAAM,EAAE;IACT;AACH,GAAE,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;AAC7B,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,KAAK,GAAG,KAAK;AACtB,GAAA;GACE,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC;AAChD,CAAA;;CAEA,SAAS,OAAO,CAAC,CAAC,EAAE;AACpB,GAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;KACzB,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;AAC9B,OAAM,OAAO,IAAI;AACjB,KAAA;AACA,GAAA,CAAG,CAAC,CAAC;AACL,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,SAAS,CAAC,UAAU,EAAE,EAAE,EAAE;GACjC,IAAI,MAAM,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;GACjC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,KAAK,EAAE;AACxC,KAAI,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AACnB,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAC5B,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,MAAM;AACf,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE;AACxB,GAAE,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE;AACrB,GAAE,IAAI;KACF,OAAO,EAAE,EAAE;AACf,GAAA,CAAG,SAAS;AACZ,KAAI,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,SAAS,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC;AAC5D,GAAA;AACA,CAAA;;AAEA,CAAA,SAAS,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE;GACxB,OAAO,EAAE,EAAE;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/version.js

@@ -1,12 +0,0 @@
-var version;
-var hasRequiredVersion;
-
-function requireVersion () {
-	if (hasRequiredVersion) return version;
-	hasRequiredVersion = 1;
-	version = "0.8.5";
-	return version;
-}
-
-export { requireVersion as __require };
-//# sourceMappingURL=version.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"version.js","sources":["../../../../node_modules/dagre/lib/version.js"],"sourcesContent":["module.exports = \"0.8.5\";\n"],"names":[],"mappings":";;;;;;AAAA,CAAA,OAAc,GAAG,OAAO;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/index.js

@@ -1,53 +0,0 @@
-import { __require as requireLib } from './lib/index.js';
-import { __require as requireJson } from './lib/json.js';
-import { __require as requireAlg } from './lib/alg/index.js';
-
-/**
- * Copyright (c) 2014, Chris Pettitt
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * 1. Redistributions of source code must retain the above copyright notice, this
- * list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright notice,
- * this list of conditions and the following disclaimer in the documentation
- * and/or other materials provided with the distribution.
- *
- * 3. Neither the name of the copyright holder nor the names of its contributors
- * may be used to endorse or promote products derived from this software without
- * specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-var graphlib;
-var hasRequiredGraphlib$1;
-
-function requireGraphlib$1 () {
-	if (hasRequiredGraphlib$1) return graphlib;
-	hasRequiredGraphlib$1 = 1;
-	var lib = requireLib();
-
-	graphlib = {
-	  Graph: lib.Graph,
-	  json: requireJson(),
-	  alg: requireAlg(),
-	  version: lib.version
-	};
-	return graphlib;
-}
-
-export { requireGraphlib$1 as __require };
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../node_modules/graphlib/index.js"],"sourcesContent":["/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,QAAc,GAAG;AACjB,GAAE,KAAK,EAAE,GAAG,CAAC,KAAK;GAChB,IAAI,EAAEC,WAAA,EAAqB;GAC3B,GAAG,EAAEC,UAAA,EAAoB;GACzB,OAAO,EAAE,GAAG,CAAC;EACd;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/components.js

@@ -1,40 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var components_1;
-var hasRequiredComponents;
-
-function requireComponents () {
-	if (hasRequiredComponents) return components_1;
-	hasRequiredComponents = 1;
-	var _ = requireLodash();
-
-	components_1 = components;
-
-	function components(g) {
-	  var visited = {};
-	  var cmpts = [];
-	  var cmpt;
-
-	  function dfs(v) {
-	    if (_.has(visited, v)) return;
-	    visited[v] = true;
-	    cmpt.push(v);
-	    _.each(g.successors(v), dfs);
-	    _.each(g.predecessors(v), dfs);
-	  }
-
-	  _.each(g.nodes(), function(v) {
-	    cmpt = [];
-	    dfs(v);
-	    if (cmpt.length) {
-	      cmpts.push(cmpt);
-	    }
-	  });
-
-	  return cmpts;
-	}
-	return components_1;
-}
-
-export { requireComponents as __require };
-//# sourceMappingURL=components.js.map

package/lib/node_modules/graphlib/lib/alg/components.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"components.js","sources":["../../../../../node_modules/graphlib/lib/alg/components.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    _.each(g.successors(v), dfs);\n    _.each(g.predecessors(v), dfs);\n  }\n\n  _.each(g.nodes(), function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,YAAc,GAAG,UAAU;;CAE3B,SAAS,UAAU,CAAC,CAAC,EAAE;GACrB,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,KAAK,GAAG,EAAE;AAChB,GAAE,IAAI,IAAI;;AAEV,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC3B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACrB,KAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAChB,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AAChC,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AAClC,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC5B,IAAI,GAAG,EAAE;KACT,GAAG,CAAC,CAAC,CAAC;AACV,KAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACrB,OAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AACtB,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,KAAK;AACd,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/dfs.js

@@ -1,55 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var dfs_1;
-var hasRequiredDfs;
-
-function requireDfs () {
-	if (hasRequiredDfs) return dfs_1;
-	hasRequiredDfs = 1;
-	var _ = requireLodash();
-
-	dfs_1 = dfs;
-
-	/*
-	 * A helper that preforms a pre- or post-order traversal on the input graph
-	 * and returns the nodes in the order they were visited. If the graph is
-	 * undirected then this algorithm will navigate using neighbors. If the graph
-	 * is directed then this algorithm will navigate using successors.
-	 *
-	 * Order must be one of "pre" or "post".
-	 */
-	function dfs(g, vs, order) {
-	  if (!_.isArray(vs)) {
-	    vs = [vs];
-	  }
-
-	  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
-
-	  var acc = [];
-	  var visited = {};
-	  _.each(vs, function(v) {
-	    if (!g.hasNode(v)) {
-	      throw new Error("Graph does not have node: " + v);
-	    }
-
-	    doDfs(g, v, order === "post", visited, navigation, acc);
-	  });
-	  return acc;
-	}
-
-	function doDfs(g, v, postorder, visited, navigation, acc) {
-	  if (!_.has(visited, v)) {
-	    visited[v] = true;
-
-	    if (!postorder) { acc.push(v); }
-	    _.each(navigation(v), function(w) {
-	      doDfs(g, w, postorder, visited, navigation, acc);
-	    });
-	    if (postorder) { acc.push(v); }
-	  }
-	}
-	return dfs_1;
-}
-
-export { requireDfs as __require };
-//# sourceMappingURL=dfs.js.map

package/lib/node_modules/graphlib/lib/alg/dfs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dfs.js","sources":["../../../../../node_modules/graphlib/lib/alg/dfs.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function(v) {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    doDfs(g, v, order === \"post\", visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) { acc.push(v); }\n    _.each(navigation(v), function(w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) { acc.push(v); }\n  }\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,KAAc,GAAG,GAAG;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE;GACzB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;AACtB,KAAI,EAAE,GAAG,CAAC,EAAE,CAAC;AACb,GAAA;;GAEE,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;;GAEtE,IAAI,GAAG,GAAG,EAAE;GACZ,IAAI,OAAO,GAAG,EAAE;GAChB,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;KACrB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AACvB,OAAM,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,CAAC,CAAC;AACvD,KAAA;;AAEA,KAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,KAAK,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC;AAC3D,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,GAAG;AACZ,CAAA;;AAEA,CAAA,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE;GACxD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC1B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;;KAEjB,IAAI,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;KAC9B,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;AACtC,OAAM,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC;AACtD,KAAA,CAAK,CAAC;KACF,IAAI,SAAS,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AACjC,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/dijkstra-all.js

@@ -1,24 +0,0 @@
-import { __require as requireDijkstra } from './dijkstra.js';
-import { __require as requireLodash } from '../lodash.js';
-
-var dijkstraAll_1;
-var hasRequiredDijkstraAll;
-
-function requireDijkstraAll () {
-	if (hasRequiredDijkstraAll) return dijkstraAll_1;
-	hasRequiredDijkstraAll = 1;
-	var dijkstra = requireDijkstra();
-	var _ = requireLodash();
-
-	dijkstraAll_1 = dijkstraAll;
-
-	function dijkstraAll(g, weightFunc, edgeFunc) {
-	  return _.transform(g.nodes(), function(acc, v) {
-	    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
-	  }, {});
-	}
-	return dijkstraAll_1;
-}
-
-export { requireDijkstraAll as __require };
-//# sourceMappingURL=dijkstra-all.js.map

package/lib/node_modules/graphlib/lib/alg/dijkstra-all.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dijkstra-all.js","sources":["../../../../../node_modules/graphlib/lib/alg/dijkstra-all.js"],"sourcesContent":["var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return _.transform(g.nodes(), function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n  }, {});\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,QAAQ,GAAGA,eAAA,EAAqB;CACpC,IAAI,CAAC,GAAGC,aAAA,EAAoB;;AAE5B,CAAA,aAAc,GAAG,WAAW;;AAE5B,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;AAC9C,GAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE;AACjD,KAAI,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC;GACjD,CAAG,EAAE,EAAE,CAAC;AACR,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/dijkstra.js

@@ -1,68 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requirePriorityQueue } from '../data/priority-queue.js';
-
-var dijkstra_1;
-var hasRequiredDijkstra;
-
-function requireDijkstra () {
-	if (hasRequiredDijkstra) return dijkstra_1;
-	hasRequiredDijkstra = 1;
-	var _ = requireLodash();
-	var PriorityQueue = requirePriorityQueue();
-
-	dijkstra_1 = dijkstra;
-
-	var DEFAULT_WEIGHT_FUNC = _.constant(1);
-
-	function dijkstra(g, source, weightFn, edgeFn) {
-	  return runDijkstra(g, String(source),
-	    weightFn || DEFAULT_WEIGHT_FUNC,
-	    edgeFn || function(v) { return g.outEdges(v); });
-	}
-
-	function runDijkstra(g, source, weightFn, edgeFn) {
-	  var results = {};
-	  var pq = new PriorityQueue();
-	  var v, vEntry;
-
-	  var updateNeighbors = function(edge) {
-	    var w = edge.v !== v ? edge.v : edge.w;
-	    var wEntry = results[w];
-	    var weight = weightFn(edge);
-	    var distance = vEntry.distance + weight;
-
-	    if (weight < 0) {
-	      throw new Error("dijkstra does not allow negative edge weights. " +
-	                      "Bad edge: " + edge + " Weight: " + weight);
-	    }
-
-	    if (distance < wEntry.distance) {
-	      wEntry.distance = distance;
-	      wEntry.predecessor = v;
-	      pq.decrease(w, distance);
-	    }
-	  };
-
-	  g.nodes().forEach(function(v) {
-	    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
-	    results[v] = { distance: distance };
-	    pq.add(v, distance);
-	  });
-
-	  while (pq.size() > 0) {
-	    v = pq.removeMin();
-	    vEntry = results[v];
-	    if (vEntry.distance === Number.POSITIVE_INFINITY) {
-	      break;
-	    }
-
-	    edgeFn(v).forEach(updateNeighbors);
-	  }
-
-	  return results;
-	}
-	return dijkstra_1;
-}
-
-export { requireDijkstra as __require };
-//# sourceMappingURL=dijkstra.js.map

package/lib/node_modules/graphlib/lib/alg/dijkstra.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dijkstra.js","sources":["../../../../../node_modules/graphlib/lib/alg/dijkstra.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,aAAa,GAAGC,oBAAA,EAAiC;;AAErD,CAAA,UAAc,GAAG,QAAQ;;AAEzB,CAAA,IAAI,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;CAEvC,SAAS,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC7C,OAAO,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC;KAClC,QAAQ,IAAI,mBAAmB;AACnC,KAAI,MAAM,IAAI,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACpD,CAAA;;CAEA,SAAS,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE;GAChD,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,EAAE,GAAG,IAAI,aAAa,EAAE;GAC5B,IAAI,CAAC,EAAE,MAAM;;AAEf,GAAE,IAAI,eAAe,GAAG,SAAS,IAAI,EAAE;AACvC,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC1C,KAAI,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,KAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;AAC/B,KAAI,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,GAAG,MAAM;;AAE3C,KAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AACpB,OAAM,MAAM,IAAI,KAAK,CAAC,iDAAiD;AACvE,uBAAsB,YAAY,GAAG,IAAI,GAAG,WAAW,GAAG,MAAM,CAAC;AACjE,KAAA;;AAEA,KAAI,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE;AACpC,OAAM,MAAM,CAAC,QAAQ,GAAG,QAAQ;AAChC,OAAM,MAAM,CAAC,WAAW,GAAG,CAAC;AAC5B,OAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC;AAC9B,KAAA;GACA,CAAG;;GAED,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;KAC5B,IAAI,QAAQ,GAAG,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,iBAAiB;KAC1D,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;AACvC,KAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC;AACvB,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACxB,KAAI,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE;AACtB,KAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;KACnB,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,iBAAiB,EAAE;OAChD;AACN,KAAA;;KAEI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;AACtC,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/find-cycles.js

@@ -1,24 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireTarjan } from './tarjan.js';
-
-var findCycles_1;
-var hasRequiredFindCycles;
-
-function requireFindCycles () {
-	if (hasRequiredFindCycles) return findCycles_1;
-	hasRequiredFindCycles = 1;
-	var _ = requireLodash();
-	var tarjan = requireTarjan();
-
-	findCycles_1 = findCycles;
-
-	function findCycles(g) {
-	  return _.filter(tarjan(g), function(cmpt) {
-	    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));
-	  });
-	}
-	return findCycles_1;
-}
-
-export { requireFindCycles as __require };
-//# sourceMappingURL=find-cycles.js.map

package/lib/node_modules/graphlib/lib/alg/find-cycles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-cycles.js","sources":["../../../../../node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return _.filter(tarjan(g), function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,MAAM,GAAGC,aAAA,EAAmB;;AAEhC,CAAA,YAAc,GAAG,UAAU;;CAE3B,SAAS,UAAU,CAAC,CAAC,EAAE;AACvB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KACxC,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/floyd-warshall.js

@@ -1,63 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var floydWarshall_1;
-var hasRequiredFloydWarshall;
-
-function requireFloydWarshall () {
-	if (hasRequiredFloydWarshall) return floydWarshall_1;
-	hasRequiredFloydWarshall = 1;
-	var _ = requireLodash();
-
-	floydWarshall_1 = floydWarshall;
-
-	var DEFAULT_WEIGHT_FUNC = _.constant(1);
-
-	function floydWarshall(g, weightFn, edgeFn) {
-	  return runFloydWarshall(g,
-	    weightFn || DEFAULT_WEIGHT_FUNC,
-	    edgeFn || function(v) { return g.outEdges(v); });
-	}
-
-	function runFloydWarshall(g, weightFn, edgeFn) {
-	  var results = {};
-	  var nodes = g.nodes();
-
-	  nodes.forEach(function(v) {
-	    results[v] = {};
-	    results[v][v] = { distance: 0 };
-	    nodes.forEach(function(w) {
-	      if (v !== w) {
-	        results[v][w] = { distance: Number.POSITIVE_INFINITY };
-	      }
-	    });
-	    edgeFn(v).forEach(function(edge) {
-	      var w = edge.v === v ? edge.w : edge.v;
-	      var d = weightFn(edge);
-	      results[v][w] = { distance: d, predecessor: v };
-	    });
-	  });
-
-	  nodes.forEach(function(k) {
-	    var rowK = results[k];
-	    nodes.forEach(function(i) {
-	      var rowI = results[i];
-	      nodes.forEach(function(j) {
-	        var ik = rowI[k];
-	        var kj = rowK[j];
-	        var ij = rowI[j];
-	        var altDistance = ik.distance + kj.distance;
-	        if (altDistance < ij.distance) {
-	          ij.distance = altDistance;
-	          ij.predecessor = kj.predecessor;
-	        }
-	      });
-	    });
-	  });
-
-	  return results;
-	}
-	return floydWarshall_1;
-}
-
-export { requireFloydWarshall as __require };
-//# sourceMappingURL=floyd-warshall.js.map

package/lib/node_modules/graphlib/lib/alg/floyd-warshall.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"floyd-warshall.js","sources":["../../../../../node_modules/graphlib/lib/alg/floyd-warshall.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,eAAc,GAAG,aAAa;;AAE9B,CAAA,IAAI,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;AAEvC,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC1C,OAAO,gBAAgB,CAAC,CAAC;KACvB,QAAQ,IAAI,mBAAmB;AACnC,KAAI,MAAM,IAAI,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACpD,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC7C,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;;AAEvB,GAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC5B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE;AACnB,KAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE;AACnC,KAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC9B,OAAM,IAAI,CAAC,KAAK,CAAC,EAAE;AACnB,SAAQ,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,iBAAiB,EAAE;AAC9D,OAAA;AACA,KAAA,CAAK,CAAC;KACF,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE;AACrC,OAAM,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5C,OAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC;AAC5B,OAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE;AACrD,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC5B,KAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;AACzB,KAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC9B,OAAM,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,OAAM,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAChC,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AACxB,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AACxB,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;SAChB,IAAI,WAAW,GAAG,EAAE,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ;AACnD,SAAQ,IAAI,WAAW,GAAG,EAAE,CAAC,QAAQ,EAAE;AACvC,WAAU,EAAE,CAAC,QAAQ,GAAG,WAAW;AACnC,WAAU,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW;AACzC,SAAA;AACA,OAAA,CAAO,CAAC;AACR,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/index.js

@@ -1,36 +0,0 @@
-import { __require as requireComponents } from './components.js';
-import { __require as requireDijkstra } from './dijkstra.js';
-import { __require as requireDijkstraAll } from './dijkstra-all.js';
-import { __require as requireFindCycles } from './find-cycles.js';
-import { __require as requireFloydWarshall } from './floyd-warshall.js';
-import { __require as requireIsAcyclic } from './is-acyclic.js';
-import { __require as requirePostorder } from './postorder.js';
-import { __require as requirePreorder } from './preorder.js';
-import { __require as requirePrim } from './prim.js';
-import { __require as requireTarjan } from './tarjan.js';
-import { __require as requireTopsort } from './topsort.js';
-
-var alg;
-var hasRequiredAlg;
-
-function requireAlg () {
-	if (hasRequiredAlg) return alg;
-	hasRequiredAlg = 1;
-	alg = {
-	  components: requireComponents(),
-	  dijkstra: requireDijkstra(),
-	  dijkstraAll: requireDijkstraAll(),
-	  findCycles: requireFindCycles(),
-	  floydWarshall: requireFloydWarshall(),
-	  isAcyclic: requireIsAcyclic(),
-	  postorder: requirePostorder(),
-	  preorder: requirePreorder(),
-	  prim: requirePrim(),
-	  tarjan: requireTarjan(),
-	  topsort: requireTopsort()
-	};
-	return alg;
-}
-
-export { requireAlg as __require };
-//# sourceMappingURL=index.js.map

package/lib/node_modules/graphlib/lib/alg/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/graphlib/lib/alg/index.js"],"sourcesContent":["module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,CAAA,GAAc,GAAG;GACf,UAAU,EAAEA,iBAAA,EAAuB;GACnC,QAAQ,EAAEC,eAAA,EAAqB;GAC/B,WAAW,EAAEC,kBAAA,EAAyB;GACtC,UAAU,EAAEC,iBAAA,EAAwB;GACpC,aAAa,EAAEC,oBAAA,EAA2B;GAC1C,SAAS,EAAEC,gBAAA,EAAuB;GAClC,SAAS,EAAEC,gBAAA,EAAsB;GACjC,QAAQ,EAAEC,eAAA,EAAqB;GAC/B,IAAI,EAAEC,WAAA,EAAiB;GACvB,MAAM,EAAEC,aAAA,EAAmB;AAC7B,GAAE,OAAO,EAAEC,cAAA;EACV;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/is-acyclic.js

@@ -1,28 +0,0 @@
-import { __require as requireTopsort } from './topsort.js';
-
-var isAcyclic_1;
-var hasRequiredIsAcyclic;
-
-function requireIsAcyclic () {
-	if (hasRequiredIsAcyclic) return isAcyclic_1;
-	hasRequiredIsAcyclic = 1;
-	var topsort = requireTopsort();
-
-	isAcyclic_1 = isAcyclic;
-
-	function isAcyclic(g) {
-	  try {
-	    topsort(g);
-	  } catch (e) {
-	    if (e instanceof topsort.CycleException) {
-	      return false;
-	    }
-	    throw e;
-	  }
-	  return true;
-	}
-	return isAcyclic_1;
-}
-
-export { requireIsAcyclic as __require };
-//# sourceMappingURL=is-acyclic.js.map

package/lib/node_modules/graphlib/lib/alg/is-acyclic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"is-acyclic.js","sources":["../../../../../node_modules/graphlib/lib/alg/is-acyclic.js"],"sourcesContent":["var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,OAAO,GAAGA,cAAA,EAAoB;;AAElC,CAAA,WAAc,GAAG,SAAS;;CAE1B,SAAS,SAAS,CAAC,CAAC,EAAE;AACtB,GAAE,IAAI;KACF,OAAO,CAAC,CAAC,CAAC;GACd,CAAG,CAAC,OAAO,CAAC,EAAE;AACd,KAAI,IAAI,CAAC,YAAY,OAAO,CAAC,cAAc,EAAE;AAC7C,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,MAAM,CAAC;AACX,GAAA;AACA,GAAE,OAAO,IAAI;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/postorder.js

@@ -1,20 +0,0 @@
-import { __require as requireDfs } from './dfs.js';
-
-var postorder_1;
-var hasRequiredPostorder;
-
-function requirePostorder () {
-	if (hasRequiredPostorder) return postorder_1;
-	hasRequiredPostorder = 1;
-	var dfs = requireDfs();
-
-	postorder_1 = postorder;
-
-	function postorder(g, vs) {
-	  return dfs(g, vs, "post");
-	}
-	return postorder_1;
-}
-
-export { requirePostorder as __require };
-//# sourceMappingURL=postorder.js.map

package/lib/node_modules/graphlib/lib/alg/postorder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"postorder.js","sources":["../../../../../node_modules/graphlib/lib/alg/postorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,WAAc,GAAG,SAAS;;AAE1B,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;GACxB,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC;AAC3B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/preorder.js

@@ -1,20 +0,0 @@
-import { __require as requireDfs } from './dfs.js';
-
-var preorder_1;
-var hasRequiredPreorder;
-
-function requirePreorder () {
-	if (hasRequiredPreorder) return preorder_1;
-	hasRequiredPreorder = 1;
-	var dfs = requireDfs();
-
-	preorder_1 = preorder;
-
-	function preorder(g, vs) {
-	  return dfs(g, vs, "pre");
-	}
-	return preorder_1;
-}
-
-export { requirePreorder as __require };
-//# sourceMappingURL=preorder.js.map

package/lib/node_modules/graphlib/lib/alg/preorder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"preorder.js","sources":["../../../../../node_modules/graphlib/lib/alg/preorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,UAAc,GAAG,QAAQ;;AAEzB,CAAA,SAAS,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE;GACvB,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC;AAC1B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/prim.js

@@ -1,67 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireGraph } from '../graph.js';
-import { __require as requirePriorityQueue } from '../data/priority-queue.js';
-
-var prim_1;
-var hasRequiredPrim;
-
-function requirePrim () {
-	if (hasRequiredPrim) return prim_1;
-	hasRequiredPrim = 1;
-	var _ = requireLodash();
-	var Graph = requireGraph();
-	var PriorityQueue = requirePriorityQueue();
-
-	prim_1 = prim;
-
-	function prim(g, weightFunc) {
-	  var result = new Graph();
-	  var parents = {};
-	  var pq = new PriorityQueue();
-	  var v;
-
-	  function updateNeighbors(edge) {
-	    var w = edge.v === v ? edge.w : edge.v;
-	    var pri = pq.priority(w);
-	    if (pri !== undefined) {
-	      var edgeWeight = weightFunc(edge);
-	      if (edgeWeight < pri) {
-	        parents[w] = v;
-	        pq.decrease(w, edgeWeight);
-	      }
-	    }
-	  }
-
-	  if (g.nodeCount() === 0) {
-	    return result;
-	  }
-
-	  _.each(g.nodes(), function(v) {
-	    pq.add(v, Number.POSITIVE_INFINITY);
-	    result.setNode(v);
-	  });
-
-	  // Start from an arbitrary node
-	  pq.decrease(g.nodes()[0], 0);
-
-	  var init = false;
-	  while (pq.size() > 0) {
-	    v = pq.removeMin();
-	    if (_.has(parents, v)) {
-	      result.setEdge(v, parents[v]);
-	    } else if (init) {
-	      throw new Error("Input graph is not connected: " + g);
-	    } else {
-	      init = true;
-	    }
-
-	    g.nodeEdges(v).forEach(updateNeighbors);
-	  }
-
-	  return result;
-	}
-	return prim_1;
-}
-
-export { requirePrim as __require };
-//# sourceMappingURL=prim.js.map

package/lib/node_modules/graphlib/lib/alg/prim.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prim.js","sources":["../../../../../node_modules/graphlib/lib/alg/prim.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  _.each(g.nodes(), function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (_.has(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,KAAK,GAAGC,YAAA,EAAmB;CAC/B,IAAI,aAAa,GAAGC,oBAAA,EAAiC;;AAErD,CAAA,MAAc,GAAG,IAAI;;AAErB,CAAA,SAAS,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE;AAC7B,GAAE,IAAI,MAAM,GAAG,IAAI,KAAK,EAAE;GACxB,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,EAAE,GAAG,IAAI,aAAa,EAAE;AAC9B,GAAE,IAAI,CAAC;;AAEP,GAAE,SAAS,eAAe,CAAC,IAAI,EAAE;AACjC,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;KACtC,IAAI,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC5B,KAAI,IAAI,GAAG,KAAK,SAAS,EAAE;AAC3B,OAAM,IAAI,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC;AACvC,OAAM,IAAI,UAAU,GAAG,GAAG,EAAE;AAC5B,SAAQ,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AACtB,SAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC;AAClC,OAAA;AACA,KAAA;AACA,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE;AAC3B,KAAI,OAAO,MAAM;AACjB,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC5B,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC;AACvC,KAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AACrB,GAAA,CAAG,CAAC;;AAEJ;AACA,GAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;;GAE5B,IAAI,IAAI,GAAG,KAAK;AAClB,GAAE,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACxB,KAAI,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE;KAClB,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACrB,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;KACnC,CAAK,MAAM,IAAI,IAAI,EAAE;AACrB,OAAM,MAAM,IAAI,KAAK,CAAC,gCAAgC,GAAG,CAAC,CAAC;AAC3D,KAAA,CAAK,MAAM;OACL,IAAI,GAAG,IAAI;AACjB,KAAA;;KAEI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;AAC3C,GAAA;;AAEA,GAAE,OAAO,MAAM;AACf,CAAA;;;;;;","x_google_ignoreList":[0]}