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

package/lib/node_modules/graphlib/lib/graph.js

@@ -0,0 +1,544 @@
+import { __require as requireLodash } from './lodash.js';
+
+var graph;
+var hasRequiredGraph;
+
+function requireGraph () {
+	if (hasRequiredGraph) return graph;
+	hasRequiredGraph = 1;
+
+	var _ = requireLodash();
+
+	graph = Graph;
+
+	var DEFAULT_EDGE_NAME = "\x00";
+	var GRAPH_NODE = "\x00";
+	var EDGE_KEY_DELIM = "\x01";
+
+	// Implementation notes:
+	//
+	//  * Node id query functions should return string ids for the nodes
+	//  * Edge id query functions should return an "edgeObj", edge object, that is
+	//    composed of enough information to uniquely identify an edge: {v, w, name}.
+	//  * Internally we use an "edgeId", a stringified form of the edgeObj, to
+	//    reference edges. This is because we need a performant way to look these
+	//    edges up and, object properties, which have string keys, are the closest
+	//    we're going to get to a performant hashtable in JavaScript.
+
+	function Graph(opts) {
+	  this._isDirected = _.has(opts, "directed") ? opts.directed : true;
+	  this._isMultigraph = _.has(opts, "multigraph") ? opts.multigraph : false;
+	  this._isCompound = _.has(opts, "compound") ? opts.compound : false;
+
+	  // Label for the graph itself
+	  this._label = undefined;
+
+	  // Defaults to be set when creating a new node
+	  this._defaultNodeLabelFn = _.constant(undefined);
+
+	  // Defaults to be set when creating a new edge
+	  this._defaultEdgeLabelFn = _.constant(undefined);
+
+	  // v -> label
+	  this._nodes = {};
+
+	  if (this._isCompound) {
+	    // v -> parent
+	    this._parent = {};
+
+	    // v -> children
+	    this._children = {};
+	    this._children[GRAPH_NODE] = {};
+	  }
+
+	  // v -> edgeObj
+	  this._in = {};
+
+	  // u -> v -> Number
+	  this._preds = {};
+
+	  // v -> edgeObj
+	  this._out = {};
+
+	  // v -> w -> Number
+	  this._sucs = {};
+
+	  // e -> edgeObj
+	  this._edgeObjs = {};
+
+	  // e -> label
+	  this._edgeLabels = {};
+	}
+
+	/* Number of nodes in the graph. Should only be changed by the implementation. */
+	Graph.prototype._nodeCount = 0;
+
+	/* Number of edges in the graph. Should only be changed by the implementation. */
+	Graph.prototype._edgeCount = 0;
+
+
+	/* === Graph functions ========= */
+
+	Graph.prototype.isDirected = function() {
+	  return this._isDirected;
+	};
+
+	Graph.prototype.isMultigraph = function() {
+	  return this._isMultigraph;
+	};
+
+	Graph.prototype.isCompound = function() {
+	  return this._isCompound;
+	};
+
+	Graph.prototype.setGraph = function(label) {
+	  this._label = label;
+	  return this;
+	};
+
+	Graph.prototype.graph = function() {
+	  return this._label;
+	};
+
+
+	/* === Node functions ========== */
+
+	Graph.prototype.setDefaultNodeLabel = function(newDefault) {
+	  if (!_.isFunction(newDefault)) {
+	    newDefault = _.constant(newDefault);
+	  }
+	  this._defaultNodeLabelFn = newDefault;
+	  return this;
+	};
+
+	Graph.prototype.nodeCount = function() {
+	  return this._nodeCount;
+	};
+
+	Graph.prototype.nodes = function() {
+	  return _.keys(this._nodes);
+	};
+
+	Graph.prototype.sources = function() {
+	  var self = this;
+	  return _.filter(this.nodes(), function(v) {
+	    return _.isEmpty(self._in[v]);
+	  });
+	};
+
+	Graph.prototype.sinks = function() {
+	  var self = this;
+	  return _.filter(this.nodes(), function(v) {
+	    return _.isEmpty(self._out[v]);
+	  });
+	};
+
+	Graph.prototype.setNodes = function(vs, value) {
+	  var args = arguments;
+	  var self = this;
+	  _.each(vs, function(v) {
+	    if (args.length > 1) {
+	      self.setNode(v, value);
+	    } else {
+	      self.setNode(v);
+	    }
+	  });
+	  return this;
+	};
+
+	Graph.prototype.setNode = function(v, value) {
+	  if (_.has(this._nodes, v)) {
+	    if (arguments.length > 1) {
+	      this._nodes[v] = value;
+	    }
+	    return this;
+	  }
+
+	  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
+	  if (this._isCompound) {
+	    this._parent[v] = GRAPH_NODE;
+	    this._children[v] = {};
+	    this._children[GRAPH_NODE][v] = true;
+	  }
+	  this._in[v] = {};
+	  this._preds[v] = {};
+	  this._out[v] = {};
+	  this._sucs[v] = {};
+	  ++this._nodeCount;
+	  return this;
+	};
+
+	Graph.prototype.node = function(v) {
+	  return this._nodes[v];
+	};
+
+	Graph.prototype.hasNode = function(v) {
+	  return _.has(this._nodes, v);
+	};
+
+	Graph.prototype.removeNode =  function(v) {
+	  var self = this;
+	  if (_.has(this._nodes, v)) {
+	    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };
+	    delete this._nodes[v];
+	    if (this._isCompound) {
+	      this._removeFromParentsChildList(v);
+	      delete this._parent[v];
+	      _.each(this.children(v), function(child) {
+	        self.setParent(child);
+	      });
+	      delete this._children[v];
+	    }
+	    _.each(_.keys(this._in[v]), removeEdge);
+	    delete this._in[v];
+	    delete this._preds[v];
+	    _.each(_.keys(this._out[v]), removeEdge);
+	    delete this._out[v];
+	    delete this._sucs[v];
+	    --this._nodeCount;
+	  }
+	  return this;
+	};
+
+	Graph.prototype.setParent = function(v, parent) {
+	  if (!this._isCompound) {
+	    throw new Error("Cannot set parent in a non-compound graph");
+	  }
+
+	  if (_.isUndefined(parent)) {
+	    parent = GRAPH_NODE;
+	  } else {
+	    // Coerce parent to string
+	    parent += "";
+	    for (var ancestor = parent;
+	      !_.isUndefined(ancestor);
+	      ancestor = this.parent(ancestor)) {
+	      if (ancestor === v) {
+	        throw new Error("Setting " + parent+ " as parent of " + v +
+	                        " would create a cycle");
+	      }
+	    }
+
+	    this.setNode(parent);
+	  }
+
+	  this.setNode(v);
+	  this._removeFromParentsChildList(v);
+	  this._parent[v] = parent;
+	  this._children[parent][v] = true;
+	  return this;
+	};
+
+	Graph.prototype._removeFromParentsChildList = function(v) {
+	  delete this._children[this._parent[v]][v];
+	};
+
+	Graph.prototype.parent = function(v) {
+	  if (this._isCompound) {
+	    var parent = this._parent[v];
+	    if (parent !== GRAPH_NODE) {
+	      return parent;
+	    }
+	  }
+	};
+
+	Graph.prototype.children = function(v) {
+	  if (_.isUndefined(v)) {
+	    v = GRAPH_NODE;
+	  }
+
+	  if (this._isCompound) {
+	    var children = this._children[v];
+	    if (children) {
+	      return _.keys(children);
+	    }
+	  } else if (v === GRAPH_NODE) {
+	    return this.nodes();
+	  } else if (this.hasNode(v)) {
+	    return [];
+	  }
+	};
+
+	Graph.prototype.predecessors = function(v) {
+	  var predsV = this._preds[v];
+	  if (predsV) {
+	    return _.keys(predsV);
+	  }
+	};
+
+	Graph.prototype.successors = function(v) {
+	  var sucsV = this._sucs[v];
+	  if (sucsV) {
+	    return _.keys(sucsV);
+	  }
+	};
+
+	Graph.prototype.neighbors = function(v) {
+	  var preds = this.predecessors(v);
+	  if (preds) {
+	    return _.union(preds, this.successors(v));
+	  }
+	};
+
+	Graph.prototype.isLeaf = function (v) {
+	  var neighbors;
+	  if (this.isDirected()) {
+	    neighbors = this.successors(v);
+	  } else {
+	    neighbors = this.neighbors(v);
+	  }
+	  return neighbors.length === 0;
+	};
+
+	Graph.prototype.filterNodes = function(filter) {
+	  var copy = new this.constructor({
+	    directed: this._isDirected,
+	    multigraph: this._isMultigraph,
+	    compound: this._isCompound
+	  });
+
+	  copy.setGraph(this.graph());
+
+	  var self = this;
+	  _.each(this._nodes, function(value, v) {
+	    if (filter(v)) {
+	      copy.setNode(v, value);
+	    }
+	  });
+
+	  _.each(this._edgeObjs, function(e) {
+	    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {
+	      copy.setEdge(e, self.edge(e));
+	    }
+	  });
+
+	  var parents = {};
+	  function findParent(v) {
+	    var parent = self.parent(v);
+	    if (parent === undefined || copy.hasNode(parent)) {
+	      parents[v] = parent;
+	      return parent;
+	    } else if (parent in parents) {
+	      return parents[parent];
+	    } else {
+	      return findParent(parent);
+	    }
+	  }
+
+	  if (this._isCompound) {
+	    _.each(copy.nodes(), function(v) {
+	      copy.setParent(v, findParent(v));
+	    });
+	  }
+
+	  return copy;
+	};
+
+	/* === Edge functions ========== */
+
+	Graph.prototype.setDefaultEdgeLabel = function(newDefault) {
+	  if (!_.isFunction(newDefault)) {
+	    newDefault = _.constant(newDefault);
+	  }
+	  this._defaultEdgeLabelFn = newDefault;
+	  return this;
+	};
+
+	Graph.prototype.edgeCount = function() {
+	  return this._edgeCount;
+	};
+
+	Graph.prototype.edges = function() {
+	  return _.values(this._edgeObjs);
+	};
+
+	Graph.prototype.setPath = function(vs, value) {
+	  var self = this;
+	  var args = arguments;
+	  _.reduce(vs, function(v, w) {
+	    if (args.length > 1) {
+	      self.setEdge(v, w, value);
+	    } else {
+	      self.setEdge(v, w);
+	    }
+	    return w;
+	  });
+	  return this;
+	};
+
+	/*
+	 * setEdge(v, w, [value, [name]])
+	 * setEdge({ v, w, [name] }, [value])
+	 */
+	Graph.prototype.setEdge = function() {
+	  var v, w, name, value;
+	  var valueSpecified = false;
+	  var arg0 = arguments[0];
+
+	  if (typeof arg0 === "object" && arg0 !== null && "v" in arg0) {
+	    v = arg0.v;
+	    w = arg0.w;
+	    name = arg0.name;
+	    if (arguments.length === 2) {
+	      value = arguments[1];
+	      valueSpecified = true;
+	    }
+	  } else {
+	    v = arg0;
+	    w = arguments[1];
+	    name = arguments[3];
+	    if (arguments.length > 2) {
+	      value = arguments[2];
+	      valueSpecified = true;
+	    }
+	  }
+
+	  v = "" + v;
+	  w = "" + w;
+	  if (!_.isUndefined(name)) {
+	    name = "" + name;
+	  }
+
+	  var e = edgeArgsToId(this._isDirected, v, w, name);
+	  if (_.has(this._edgeLabels, e)) {
+	    if (valueSpecified) {
+	      this._edgeLabels[e] = value;
+	    }
+	    return this;
+	  }
+
+	  if (!_.isUndefined(name) && !this._isMultigraph) {
+	    throw new Error("Cannot set a named edge when isMultigraph = false");
+	  }
+
+	  // It didn't exist, so we need to create it.
+	  // First ensure the nodes exist.
+	  this.setNode(v);
+	  this.setNode(w);
+
+	  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);
+
+	  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
+	  // Ensure we add undirected edges in a consistent way.
+	  v = edgeObj.v;
+	  w = edgeObj.w;
+
+	  Object.freeze(edgeObj);
+	  this._edgeObjs[e] = edgeObj;
+	  incrementOrInitEntry(this._preds[w], v);
+	  incrementOrInitEntry(this._sucs[v], w);
+	  this._in[w][e] = edgeObj;
+	  this._out[v][e] = edgeObj;
+	  this._edgeCount++;
+	  return this;
+	};
+
+	Graph.prototype.edge = function(v, w, name) {
+	  var e = (arguments.length === 1
+	    ? edgeObjToId(this._isDirected, arguments[0])
+	    : edgeArgsToId(this._isDirected, v, w, name));
+	  return this._edgeLabels[e];
+	};
+
+	Graph.prototype.hasEdge = function(v, w, name) {
+	  var e = (arguments.length === 1
+	    ? edgeObjToId(this._isDirected, arguments[0])
+	    : edgeArgsToId(this._isDirected, v, w, name));
+	  return _.has(this._edgeLabels, e);
+	};
+
+	Graph.prototype.removeEdge = function(v, w, name) {
+	  var e = (arguments.length === 1
+	    ? edgeObjToId(this._isDirected, arguments[0])
+	    : edgeArgsToId(this._isDirected, v, w, name));
+	  var edge = this._edgeObjs[e];
+	  if (edge) {
+	    v = edge.v;
+	    w = edge.w;
+	    delete this._edgeLabels[e];
+	    delete this._edgeObjs[e];
+	    decrementOrRemoveEntry(this._preds[w], v);
+	    decrementOrRemoveEntry(this._sucs[v], w);
+	    delete this._in[w][e];
+	    delete this._out[v][e];
+	    this._edgeCount--;
+	  }
+	  return this;
+	};
+
+	Graph.prototype.inEdges = function(v, u) {
+	  var inV = this._in[v];
+	  if (inV) {
+	    var edges = _.values(inV);
+	    if (!u) {
+	      return edges;
+	    }
+	    return _.filter(edges, function(edge) { return edge.v === u; });
+	  }
+	};
+
+	Graph.prototype.outEdges = function(v, w) {
+	  var outV = this._out[v];
+	  if (outV) {
+	    var edges = _.values(outV);
+	    if (!w) {
+	      return edges;
+	    }
+	    return _.filter(edges, function(edge) { return edge.w === w; });
+	  }
+	};
+
+	Graph.prototype.nodeEdges = function(v, w) {
+	  var inEdges = this.inEdges(v, w);
+	  if (inEdges) {
+	    return inEdges.concat(this.outEdges(v, w));
+	  }
+	};
+
+	function incrementOrInitEntry(map, k) {
+	  if (map[k]) {
+	    map[k]++;
+	  } else {
+	    map[k] = 1;
+	  }
+	}
+
+	function decrementOrRemoveEntry(map, k) {
+	  if (!--map[k]) { delete map[k]; }
+	}
+
+	function edgeArgsToId(isDirected, v_, w_, name) {
+	  var v = "" + v_;
+	  var w = "" + w_;
+	  if (!isDirected && v > w) {
+	    var tmp = v;
+	    v = w;
+	    w = tmp;
+	  }
+	  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +
+	             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);
+	}
+
+	function edgeArgsToObj(isDirected, v_, w_, name) {
+	  var v = "" + v_;
+	  var w = "" + w_;
+	  if (!isDirected && v > w) {
+	    var tmp = v;
+	    v = w;
+	    w = tmp;
+	  }
+	  var edgeObj =  { v: v, w: w };
+	  if (name) {
+	    edgeObj.name = name;
+	  }
+	  return edgeObj;
+	}
+
+	function edgeObjToId(isDirected, edgeObj) {
+	  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
+	}
+	return graph;
+}
+
+export { requireGraph as __require };
+//# sourceMappingURL=graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sources":["../../../../node_modules/graphlib/lib/graph.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;;AAE3B,CAAA,KAAc,GAAG,KAAK;;CAEtB,IAAI,iBAAiB,GAAG,MAAM;CAC9B,IAAI,UAAU,GAAG,MAAM;CACvB,IAAI,cAAc,GAAG,MAAM;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;CAEA,SAAS,KAAK,CAAC,IAAI,EAAE;AACrB,GAAE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI;AACnE,GAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK;AAC1E,GAAE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,KAAK;;AAEpE;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,SAAS;;AAEzB;GACE,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;;AAElD;GACE,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;;AAElD;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,EAAE;;AAElB,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;AACxB;AACA,KAAI,IAAI,CAAC,OAAO,GAAG,EAAE;;AAErB;AACA,KAAI,IAAI,CAAC,SAAS,GAAG,EAAE;AACvB,KAAI,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAE;AACnC,GAAA;;AAEA;AACA,GAAE,IAAI,CAAC,GAAG,GAAG,EAAE;;AAEf;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,EAAE;;AAElB;AACA,GAAE,IAAI,CAAC,IAAI,GAAG,EAAE;;AAEhB;AACA,GAAE,IAAI,CAAC,KAAK,GAAG,EAAE;;AAEjB;AACA,GAAE,IAAI,CAAC,SAAS,GAAG,EAAE;;AAErB;AACA,GAAE,IAAI,CAAC,WAAW,GAAG,EAAE;AACvB,CAAA;;AAEA;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC;;AAE9B;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC;;;AAG9B;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,WAAW;GACtC,OAAO,IAAI,CAAC,WAAW;CACzB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,YAAY,GAAG,WAAW;GACxC,OAAO,IAAI,CAAC,aAAa;CAC3B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,WAAW;GACtC,OAAO,IAAI,CAAC,WAAW;CACzB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,KAAK,EAAE;AAC3C,GAAE,IAAI,CAAC,MAAM,GAAG,KAAK;AACrB,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,IAAI,CAAC,MAAM;CACpB,CAAC;;;AAGD;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,mBAAmB,GAAG,SAAS,UAAU,EAAE;GACzD,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACjC,KAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;AACvC,GAAA;AACA,GAAE,IAAI,CAAC,mBAAmB,GAAG,UAAU;AACvC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;GACrC,OAAO,IAAI,CAAC,UAAU;CACxB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;CAC5B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;GACnC,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjC,GAAA,CAAG,CAAC;CACJ,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClC,GAAA,CAAG,CAAC;CACJ,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,EAAE,EAAE,KAAK,EAAE;GAC7C,IAAI,IAAI,GAAG,SAAS;GACpB,IAAI,IAAI,GAAG,IAAI;GACf,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;AACzB,KAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AACzB,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE;GAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE;AAC7B,KAAI,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B,OAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK;AAC5B,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA;;GAEE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;AAC7E,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;AACxB,KAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU;AAChC,KAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE;KACtB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AACxC,GAAA;AACA,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AAClB,GAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE;AACrB,GAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE;AACnB,GAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE;GAClB,EAAE,IAAI,CAAC,UAAU;AACnB,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,EAAE;AACnC,GAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACvB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE;GACpC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;CAC9B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,EAAE;GACxC,IAAI,IAAI,GAAG,IAAI;GACf,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE;AAC7B,KAAI,IAAI,UAAU,GAAG,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE;AACxE,KAAI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzB,KAAI,IAAI,IAAI,CAAC,WAAW,EAAE;AAC1B,OAAM,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;AACzC,OAAM,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAC5B,OAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,KAAK,EAAE;AAC/C,SAAQ,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;AAC7B,OAAA,CAAO,CAAC;AACR,OAAM,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AAC9B,KAAA;AACA,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;AAC3C,KAAI,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACtB,KAAI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzB,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;AAC5C,KAAI,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACvB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;KACpB,EAAE,IAAI,CAAC,UAAU;AACrB,GAAA;AACA,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,MAAM,EAAE;AAChD,GAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;AACzB,KAAI,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC;AAChE,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;KACzB,MAAM,GAAG,UAAU;AACvB,GAAA,CAAG,MAAM;AACT;KACI,MAAM,IAAI,EAAE;AAChB,KAAI,KAAK,IAAI,QAAQ,GAAG,MAAM;AAC9B,OAAM,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC;OACxB,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;AACxC,OAAM,IAAI,QAAQ,KAAK,CAAC,EAAE;SAClB,MAAM,IAAI,KAAK,CAAC,UAAU,GAAG,MAAM,EAAE,gBAAgB,GAAG,CAAC;AACjE,yBAAwB,uBAAuB,CAAC;AAChD,OAAA;AACA,KAAA;;AAEA,KAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;AACxB,GAAA;;AAEA,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACjB,GAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;AACrC,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM;GACxB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAClC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,2BAA2B,GAAG,SAAS,CAAC,EAAE;AAC1D,GAAE,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3C,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE;AACrC,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAChC,KAAI,IAAI,MAAM,KAAK,UAAU,EAAE;AAC/B,OAAM,OAAO,MAAM;AACnB,KAAA;AACA,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE;AACvC,GAAE,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE;KACpB,CAAC,GAAG,UAAU;AAClB,GAAA;;AAEA,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;KAChC,IAAI,QAAQ,EAAE;AAClB,OAAM,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC7B,KAAA;AACA,GAAA,CAAG,MAAM,IAAI,CAAC,KAAK,UAAU,EAAE;AAC/B,KAAI,OAAO,IAAI,CAAC,KAAK,EAAE;GACvB,CAAG,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC9B,KAAI,OAAO,EAAE;AACb,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,YAAY,GAAG,SAAS,CAAC,EAAE;GACzC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;GAC3B,IAAI,MAAM,EAAE;AACd,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;AACzB,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,SAAS,CAAC,EAAE;GACvC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;GACzB,IAAI,KAAK,EAAE;AACb,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AACxB,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE;GACtC,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;GAChC,IAAI,KAAK,EAAE;AACb,KAAI,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC7C,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE;AACtC,GAAE,IAAI,SAAS;AACf,GAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;AACzB,KAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AAClC,GAAA,CAAG,MAAM;AACT,KAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AACjC,GAAA;AACA,GAAE,OAAO,SAAS,CAAC,MAAM,KAAK,CAAC;CAC/B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,MAAM,EAAE;AAC/C,GAAE,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC;AAClC,KAAI,QAAQ,EAAE,IAAI,CAAC,WAAW;AAC9B,KAAI,UAAU,EAAE,IAAI,CAAC,aAAa;KAC9B,QAAQ,EAAE,IAAI,CAAC;AACnB,IAAG,CAAC;;GAEF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;;GAE3B,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE;AACzC,KAAI,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;AACnB,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5B,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE;AACrC,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;AAChD,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnC,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,SAAS,UAAU,CAAC,CAAC,EAAE;KACrB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;KAC3B,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;AACtD,OAAM,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM;AACzB,OAAM,OAAO,MAAM;AACnB,KAAA,CAAK,MAAM,IAAI,MAAM,IAAI,OAAO,EAAE;AAClC,OAAM,OAAO,OAAO,CAAC,MAAM,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,OAAO,UAAU,CAAC,MAAM,CAAC;AAC/B,KAAA;AACA,GAAA;;AAEA,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;OAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;AACtC,KAAA,CAAK,CAAC;AACN,GAAA;;AAEA,GAAE,OAAO,IAAI;CACb,CAAC;;AAED;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,mBAAmB,GAAG,SAAS,UAAU,EAAE;GACzD,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACjC,KAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;AACvC,GAAA;AACA,GAAE,IAAI,CAAC,mBAAmB,GAAG,UAAU;AACvC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;GACrC,OAAO,IAAI,CAAC,UAAU;CACxB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;CACjC,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,EAAE,EAAE,KAAK,EAAE;GAC5C,IAAI,IAAI,GAAG,IAAI;GACf,IAAI,IAAI,GAAG,SAAS;GACpB,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;AAC9B,KAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;OACnB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AAC/B,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;AACxB,KAAA;AACA,KAAI,OAAO,CAAC;AACZ,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,IAAI;CACb,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;AACrC,GAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK;GACrB,IAAI,cAAc,GAAG,KAAK;AAC5B,GAAE,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;;AAEzB,GAAE,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAChE,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,IAAI,GAAG,IAAI,CAAC,IAAI;AACpB,KAAI,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AAChC,OAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;OACpB,cAAc,GAAG,IAAI;AAC3B,KAAA;AACA,GAAA,CAAG,MAAM;KACL,CAAC,GAAG,IAAI;AACZ,KAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AACpB,KAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,KAAI,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B,OAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;OACpB,cAAc,GAAG,IAAI;AAC3B,KAAA;AACA,GAAA;;AAEA,GAAE,CAAC,GAAG,EAAE,GAAG,CAAC;AACZ,GAAE,CAAC,GAAG,EAAE,GAAG,CAAC;GACV,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;AAC5B,KAAI,IAAI,GAAG,EAAE,GAAG,IAAI;AACpB,GAAA;;AAEA,GAAE,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;GAClD,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE;KAC9B,IAAI,cAAc,EAAE;AACxB,OAAM,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK;AACjC,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;AACnD,KAAI,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC;AACxE,GAAA;;AAEA;AACA;AACA,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACjB,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;;GAEf,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;;AAErF,GAAE,IAAI,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AAC3D;AACA,GAAE,CAAC,GAAG,OAAO,CAAC,CAAC;AACf,GAAE,CAAC,GAAG,OAAO,CAAC,CAAC;;AAEf,GAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;AACxB,GAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO;GAC3B,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;GACvC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;GACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;GACxB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;GACzB,IAAI,CAAC,UAAU,EAAE;AACnB,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAC5C,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACjD,GAAE,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;CAC5B,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAC/C,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;GAC/C,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CACnC,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAClD,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;GAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;GAC5B,IAAI,IAAI,EAAE;AACZ,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AAC9B,KAAI,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;KACxB,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACzC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACxC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACtB,IAAI,CAAC,UAAU,EAAE;AACrB,GAAA;AACA,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACvC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;GACrB,IAAI,GAAG,EAAE;KACP,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;KACzB,IAAI,CAAC,CAAC,EAAE;AACZ,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACnE,GAAA;CACA,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACxC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;GACvB,IAAI,IAAI,EAAE;KACR,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;KAC1B,IAAI,CAAC,CAAC,EAAE;AACZ,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACnE,GAAA;CACA,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACzC,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;GAChC,IAAI,OAAO,EAAE;AACf,KAAI,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9C,GAAA;CACA,CAAC;;AAED,CAAA,SAAS,oBAAoB,CAAC,GAAG,EAAE,CAAC,EAAE;AACtC,GAAE,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE;AACd,KAAI,GAAG,CAAC,CAAC,CAAC,EAAE;AACZ,GAAA,CAAG,MAAM;AACT,KAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACd,GAAA;AACA,CAAA;;AAEA,CAAA,SAAS,sBAAsB,CAAC,GAAG,EAAE,CAAC,EAAE;AACxC,GAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;AACjC,CAAA;;CAEA,SAAS,YAAY,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;AAChD,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;KACxB,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;AACA,GAAE,OAAO,CAAC,GAAG,cAAc,GAAG,CAAC,GAAG,cAAc;eAClC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,iBAAiB,GAAG,IAAI,CAAC;AAC7D,CAAA;;CAEA,SAAS,aAAa,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;AACjD,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;KACxB,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;GACE,IAAI,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;GAC7B,IAAI,IAAI,EAAE;AACZ,KAAI,OAAO,CAAC,IAAI,GAAG,IAAI;AACvB,GAAA;AACA,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE;AAC1C,GAAE,OAAO,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC;AACrE,CAAA;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,19 @@
+import { __require as requireGraph } from './graph.js';
+import { __require as requireVersion } from './version.js';
+
+var lib;
+var hasRequiredLib;
+
+function requireLib () {
+	if (hasRequiredLib) return lib;
+	hasRequiredLib = 1;
+	// Includes only the "core" of graphlib
+	lib = {
+	  Graph: requireGraph(),
+	  version: requireVersion()
+	};
+	return lib;
+}
+
+export { requireLib as __require };
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../node_modules/graphlib/lib/index.js"],"sourcesContent":["// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;AAAA;AACA,CAAA,GAAc,GAAG;GACf,KAAK,EAAEA,YAAA,EAAkB;AAC3B,GAAE,OAAO,EAAEC,cAAA;EACV;;;;;;","x_google_ignoreList":[0]}