aureooms-js-adjacency-list - npm Package Compare versions

Comparing version 2.0.1 to 3.0.0

bower.json

@@ -15,3 +15,3 @@ {
 	],
-	"version": "2.0.1",
+	"version": "3.0.0",
 	"main": "js/dist/adjacency-list.js",
@@ -18,0 +18,0 @@ "homepage": "http://aureooms.github.io/js-adjacency-list/",

component.json

@@ -7,3 +7,3 @@ {
 	"description": "adjacency list code bricks for JavaScript",
-	"version": "2.0.1",
+	"version": "3.0.0",
 	"main": "js/dist/adjacency-list.js",
@@ -10,0 +10,0 @@ "name": "aureooms-js-adjacency-list",

js/dist/adjacency-list.js

 "use strict";
 
+var _slicedToArray = (function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"]) _i["return"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }; })();
+
 (function () {
@@ -9,2 +11,24 @@
 
+		/* js/src/DiEdge.js */
+
+		var DiEdge = function DiEdge(u, v, list) {
+
+			this.u = u;
+			this.v = v;
+			this.iterator = null;
+			this.twin = null;
+			this.list = list;
+		};
+
+		exports.DiEdge = DiEdge;
+
+		/* js/src/DiVertex.js */
+
+		var DiVertex = function DiVertex() {
+
+			this.iterator = null;
+		};
+
+		exports.DiVertex = DiVertex;
+
 		/* js/src/Edge.js */
@@ -23,16 +47,34 @@
 
-		/* js/src/List.js */
+		/* js/src/MultiDiGraph.js */
 
-		var List = function List(DLL) {
+		/**
+   * Complexity of each update operation in comments for
+   * classical Doubly Linked List and Hash Map implementations.
+   * Complexity in O(.) notation is most likely amortized time
+   * for operation involving the successors and predecessors maps.
+   */
 
+		var MultiDiGraph = function MultiDiGraph(List, Map) {
+
+			/**
+    * O(1)
+    */
 			var Graph = function Graph() {
 
-				this.V = new DLL();
-				this.E = new DLL();
+				this.V = new List();
+
+				this.succ = new Map();
+				this.pred = new Map();
 			};
 
+			/**
+    * O(1)
+    */
 			Graph.prototype.vadd = function () {
 
-				var v = new Vertex(new DLL());
+				var v = new DiVertex();
 
+				this.succ.set(v, new List());
+				this.pred.set(v, new List());
+
 				v.iterator = this.V.push(v);
@@ -43,5 +85,8 @@
 
+			/**
+    * O(n) where n is the degree of v
+    */
 			Graph.prototype.vdel = function (v) {
 
-				// remove all incident edges
+				// remove all ingoing and outgoing edges
 				var _iteratorNormalCompletion = true;
@@ -52,3 +97,3 @@ var _didIteratorError = false;
 				try {
-					for (var _iterator = this.iitr(v)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+					for (var _iterator = this.initr(v)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
 						var e = _step.value;
@@ -72,8 +117,649 @@ this.edel(e);
 
+				var _iteratorNormalCompletion2 = true;
+				var _didIteratorError2 = false;
+				var _iteratorError2 = undefined;
+
+				try {
+					for (var _iterator2 = this.outitr(v)[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
+						var e = _step2.value;
+						this.edel(e);
+					}
+				} catch (err) {
+					_didIteratorError2 = true;
+					_iteratorError2 = err;
+				} finally {
+					try {
+						if (!_iteratorNormalCompletion2 && _iterator2["return"]) {
+							_iterator2["return"]();
+						}
+					} finally {
+						if (_didIteratorError2) {
+							throw _iteratorError2;
+						}
+					}
+				}
+
+				this.pred["delete"](v);
+				this.succ["delete"](v);
+
 				// remove vertex
-				this.E.erase(v.iterator);
+				this.V.erase(v.iterator);
 			};
 
+			/**
+    * O(1)
+    */
 			Graph.prototype.eadd = function (u, v) {
 
+				var uv = new DiEdge(u, v, this.succ);
+				var vu = new DiEdge(v, u, this.pred);
+
+				// add to edge list of u
+				uv.iterator = this.succ.get(u).push(uv);
+
+				// add to edge list of v
+				vu.iterator = this.pred.get(v).push(vu);
+
+				// set twin
+				uv.twin = vu;
+				vu.twin = uv;
+
+				return uv;
+			};
+
+			/**
+    * O(1)
+    */
+			Graph.prototype.edel = function (e) {
+
+				e.list.erase(e.iterator);
+				e.twin.list.erase(e.twin.iterator);
+			};
+
+			Graph.prototype.vitr = regeneratorRuntime.mark(function callee$3$0() {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.V, "t0", 1);
+
+						case 1:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.eitr = regeneratorRuntime.mark(function callee$3$0() {
+				var _iteratorNormalCompletion3, _didIteratorError3, _iteratorError3, _iterator3, _step3, _step3$value, _, edges;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion3 = true;
+							_didIteratorError3 = false;
+							_iteratorError3 = undefined;
+							context$4$0.prev = 3;
+							_iterator3 = this.succ[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done) {
+								context$4$0.next = 13;
+								break;
+							}
+
+							_step3$value = _slicedToArray(_step3.value, 2);
+							_ = _step3$value[0];
+							edges = _step3$value[1];
+							return context$4$0.delegateYield(edges, "t0", 10);
+
+						case 10:
+							_iteratorNormalCompletion3 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 13:
+							context$4$0.next = 19;
+							break;
+
+						case 15:
+							context$4$0.prev = 15;
+							context$4$0.t1 = context$4$0["catch"](3);
+							_didIteratorError3 = true;
+							_iteratorError3 = context$4$0.t1;
+
+						case 19:
+							context$4$0.prev = 19;
+							context$4$0.prev = 20;
+
+							if (!_iteratorNormalCompletion3 && _iterator3["return"]) {
+								_iterator3["return"]();
+							}
+
+						case 22:
+							context$4$0.prev = 22;
+
+							if (!_didIteratorError3) {
+								context$4$0.next = 25;
+								break;
+							}
+
+							throw _iteratorError3;
+
+						case 25:
+							return context$4$0.finish(22);
+
+						case 26:
+							return context$4$0.finish(19);
+
+						case 27:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 15, 19, 27], [20,, 22, 26]]);
+			});
+
+			Graph.prototype.iitr = regeneratorRuntime.mark(function callee$3$0(v) {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.initr(v), "t0", 1);
+
+						case 1:
+							return context$4$0.delegateYield(this.outitr(v), "t1", 2);
+
+						case 2:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.initr = regeneratorRuntime.mark(function callee$3$0(v) {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.pred.get(v), "t0", 1);
+
+						case 1:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.outitr = regeneratorRuntime.mark(function callee$3$0(v) {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.succ.get(v), "t0", 1);
+
+						case 1:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.nitr = regeneratorRuntime.mark(function callee$3$0(u) {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.dsitr(u), "t0", 1);
+
+						case 1:
+							return context$4$0.delegateYield(this.dpitr(u), "t1", 2);
+
+						case 2:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.dsitr = regeneratorRuntime.mark(function callee$3$0(u) {
+				var _iteratorNormalCompletion4, _didIteratorError4, _iteratorError4, _iterator4, _step4, v;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion4 = true;
+							_didIteratorError4 = false;
+							_iteratorError4 = undefined;
+							context$4$0.prev = 3;
+							_iterator4 = this.succ.get(u)[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done) {
+								context$4$0.next = 12;
+								break;
+							}
+
+							v = _step4.value.v;
+							context$4$0.next = 9;
+							return v;
+
+						case 9:
+							_iteratorNormalCompletion4 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 12:
+							context$4$0.next = 18;
+							break;
+
+						case 14:
+							context$4$0.prev = 14;
+							context$4$0.t0 = context$4$0["catch"](3);
+							_didIteratorError4 = true;
+							_iteratorError4 = context$4$0.t0;
+
+						case 18:
+							context$4$0.prev = 18;
+							context$4$0.prev = 19;
+
+							if (!_iteratorNormalCompletion4 && _iterator4["return"]) {
+								_iterator4["return"]();
+							}
+
+						case 21:
+							context$4$0.prev = 21;
+
+							if (!_didIteratorError4) {
+								context$4$0.next = 24;
+								break;
+							}
+
+							throw _iteratorError4;
+
+						case 24:
+							return context$4$0.finish(21);
+
+						case 25:
+							return context$4$0.finish(18);
+
+						case 26:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 14, 18, 26], [19,, 21, 25]]);
+			});
+
+			Graph.prototype.dpitr = regeneratorRuntime.mark(function callee$3$0(u) {
+				var _iteratorNormalCompletion5, _didIteratorError5, _iteratorError5, _iterator5, _step5, v;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion5 = true;
+							_didIteratorError5 = false;
+							_iteratorError5 = undefined;
+							context$4$0.prev = 3;
+							_iterator5 = this.pred.get(u)[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done) {
+								context$4$0.next = 12;
+								break;
+							}
+
+							v = _step5.value.v;
+							context$4$0.next = 9;
+							return v;
+
+						case 9:
+							_iteratorNormalCompletion5 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 12:
+							context$4$0.next = 18;
+							break;
+
+						case 14:
+							context$4$0.prev = 14;
+							context$4$0.t0 = context$4$0["catch"](3);
+							_didIteratorError5 = true;
+							_iteratorError5 = context$4$0.t0;
+
+						case 18:
+							context$4$0.prev = 18;
+							context$4$0.prev = 19;
+
+							if (!_iteratorNormalCompletion5 && _iterator5["return"]) {
+								_iterator5["return"]();
+							}
+
+						case 21:
+							context$4$0.prev = 21;
+
+							if (!_didIteratorError5) {
+								context$4$0.next = 24;
+								break;
+							}
+
+							throw _iteratorError5;
+
+						case 24:
+							return context$4$0.finish(21);
+
+						case 25:
+							return context$4$0.finish(18);
+
+						case 26:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 14, 18, 26], [19,, 21, 25]]);
+			});
+
+			Graph.prototype.edges = regeneratorRuntime.mark(function callee$3$0() {
+				var _iteratorNormalCompletion6, _didIteratorError6, _iteratorError6, _iterator6, _step6, e;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion6 = true;
+							_didIteratorError6 = false;
+							_iteratorError6 = undefined;
+							context$4$0.prev = 3;
+							_iterator6 = this.eitr()[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done) {
+								context$4$0.next = 12;
+								break;
+							}
+
+							e = _step6.value;
+							context$4$0.next = 9;
+							return [e.u, e.v, e];
+
+						case 9:
+							_iteratorNormalCompletion6 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 12:
+							context$4$0.next = 18;
+							break;
+
+						case 14:
+							context$4$0.prev = 14;
+							context$4$0.t0 = context$4$0["catch"](3);
+							_didIteratorError6 = true;
+							_iteratorError6 = context$4$0.t0;
+
+						case 18:
+							context$4$0.prev = 18;
+							context$4$0.prev = 19;
+
+							if (!_iteratorNormalCompletion6 && _iterator6["return"]) {
+								_iterator6["return"]();
+							}
+
+						case 21:
+							context$4$0.prev = 21;
+
+							if (!_didIteratorError6) {
+								context$4$0.next = 24;
+								break;
+							}
+
+							throw _iteratorError6;
+
+						case 24:
+							return context$4$0.finish(21);
+
+						case 25:
+							return context$4$0.finish(18);
+
+						case 26:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 14, 18, 26], [19,, 21, 25]]);
+			});
+
+			Graph.prototype.incident = regeneratorRuntime.mark(function callee$3$0(u) {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.ingoing(u), "t0", 1);
+
+						case 1:
+							return context$4$0.delegateYield(this.outgoing(u), "t1", 2);
+
+						case 2:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
+			Graph.prototype.ingoing = regeneratorRuntime.mark(function callee$3$0(u) {
+				var _iteratorNormalCompletion7, _didIteratorError7, _iteratorError7, _iterator7, _step7, e;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion7 = true;
+							_didIteratorError7 = false;
+							_iteratorError7 = undefined;
+							context$4$0.prev = 3;
+							_iterator7 = this.initr(u)[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done) {
+								context$4$0.next = 12;
+								break;
+							}
+
+							e = _step7.value;
+							context$4$0.next = 9;
+							return [e.u, e.v, e];
+
+						case 9:
+							_iteratorNormalCompletion7 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 12:
+							context$4$0.next = 18;
+							break;
+
+						case 14:
+							context$4$0.prev = 14;
+							context$4$0.t0 = context$4$0["catch"](3);
+							_didIteratorError7 = true;
+							_iteratorError7 = context$4$0.t0;
+
+						case 18:
+							context$4$0.prev = 18;
+							context$4$0.prev = 19;
+
+							if (!_iteratorNormalCompletion7 && _iterator7["return"]) {
+								_iterator7["return"]();
+							}
+
+						case 21:
+							context$4$0.prev = 21;
+
+							if (!_didIteratorError7) {
+								context$4$0.next = 24;
+								break;
+							}
+
+							throw _iteratorError7;
+
+						case 24:
+							return context$4$0.finish(21);
+
+						case 25:
+							return context$4$0.finish(18);
+
+						case 26:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 14, 18, 26], [19,, 21, 25]]);
+			});
+
+			Graph.prototype.outgoing = regeneratorRuntime.mark(function callee$3$0(u) {
+				var _iteratorNormalCompletion8, _didIteratorError8, _iteratorError8, _iterator8, _step8, e;
+
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							_iteratorNormalCompletion8 = true;
+							_didIteratorError8 = false;
+							_iteratorError8 = undefined;
+							context$4$0.prev = 3;
+							_iterator8 = this.outitr(u)[Symbol.iterator]();
+
+						case 5:
+							if (_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done) {
+								context$4$0.next = 12;
+								break;
+							}
+
+							e = _step8.value;
+							context$4$0.next = 9;
+							return [e.u, e.v, e];
+
+						case 9:
+							_iteratorNormalCompletion8 = true;
+							context$4$0.next = 5;
+							break;
+
+						case 12:
+							context$4$0.next = 18;
+							break;
+
+						case 14:
+							context$4$0.prev = 14;
+							context$4$0.t0 = context$4$0["catch"](3);
+							_didIteratorError8 = true;
+							_iteratorError8 = context$4$0.t0;
+
+						case 18:
+							context$4$0.prev = 18;
+							context$4$0.prev = 19;
+
+							if (!_iteratorNormalCompletion8 && _iterator8["return"]) {
+								_iterator8["return"]();
+							}
+
+						case 21:
+							context$4$0.prev = 21;
+
+							if (!_didIteratorError8) {
+								context$4$0.next = 24;
+								break;
+							}
+
+							throw _iteratorError8;
+
+						case 24:
+							return context$4$0.finish(21);
+
+						case 25:
+							return context$4$0.finish(18);
+
+						case 26:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this, [[3, 14, 18, 26], [19,, 21, 25]]);
+			});
+
+			Graph.prototype.endpoints = function (e) {
+
+				return [e.u, e.v];
+			};
+
+			/**
+    * O(1)
+    */
+			Graph.prototype.reverse = function () {
+				var _ref = [this.pred, this.succ];
+				this.succ = _ref[0];
+				this.pred = _ref[1];
+
+				return this;
+			};
+
+			return Graph;
+		};
+
+		exports.MultiDiGraph = MultiDiGraph;
+
+		/* js/src/MultiGraph.js */
+
+		/**
+   * Complexity of each update operation in comments for
+   * a classical Doubly Linked List implementation.
+   */
+
+		var MultiGraph = function MultiGraph(List) {
+
+			/**
+    * O(1)
+    */
+			var Graph = function Graph() {
+
+				this.V = new List();
+				this.E = new List();
+			};
+
+			/**
+    * O(1)
+    */
+			Graph.prototype.vadd = function () {
+
+				var v = new Vertex(new List());
+
+				v.iterator = this.V.push(v);
+
+				return v;
+			};
+
+			/**
+    * O(n) where n is the degree of v
+    */
+			Graph.prototype.vdel = function (v) {
+
+				// remove all incident edges
+				var _iteratorNormalCompletion9 = true;
+				var _didIteratorError9 = false;
+				var _iteratorError9 = undefined;
+
+				try {
+					for (var _iterator9 = this.iitr(v)[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {
+						var e = _step9.value;
+						this.edel(e);
+					}
+				} catch (err) {
+					_didIteratorError9 = true;
+					_iteratorError9 = err;
+				} finally {
+					try {
+						if (!_iteratorNormalCompletion9 && _iterator9["return"]) {
+							_iterator9["return"]();
+						}
+					} finally {
+						if (_didIteratorError9) {
+							throw _iteratorError9;
+						}
+					}
+				}
+
+				// remove vertex
+				this.V.erase(v.iterator);
+			};
+
+			/**
+    * O(1)
+    */
+			Graph.prototype.eadd = function (u, v) {
+
 				var e = new Edge(u, v);
@@ -93,2 +779,5 @@
 
+			/**
+    * O(1)
+    */
 			Graph.prototype.edel = function (e) {
@@ -119,2 +808,15 @@
 
+			Graph.prototype.eitr = regeneratorRuntime.mark(function callee$3$0() {
+				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
+					while (1) switch (context$4$0.prev = context$4$0.next) {
+						case 0:
+							return context$4$0.delegateYield(this.E, "t0", 1);
+
+						case 1:
+						case "end":
+							return context$4$0.stop();
+					}
+				}, callee$3$0, this);
+			});
+
 			Graph.prototype.iitr = regeneratorRuntime.mark(function callee$3$0(v) {
@@ -133,4 +835,7 @@ return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
 
+			Graph.prototype.initr = Graph.prototype.iitr;
+			Graph.prototype.outitr = Graph.prototype.iitr;
+
 			Graph.prototype.nitr = regeneratorRuntime.mark(function callee$3$0(w) {
-				var _iteratorNormalCompletion2, _didIteratorError2, _iteratorError2, _iterator2, _step2, _step2$value, u, v;
+				var _iteratorNormalCompletion10, _didIteratorError10, _iteratorError10, _iterator10, _step10, _step10$value, u, v;
 
@@ -140,10 +845,10 @@ return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
 						case 0:
-							_iteratorNormalCompletion2 = true;
-							_didIteratorError2 = false;
-							_iteratorError2 = undefined;
+							_iteratorNormalCompletion10 = true;
+							_didIteratorError10 = false;
+							_iteratorError10 = undefined;
 							context$4$0.prev = 3;
-							_iterator2 = w.E[Symbol.iterator]();
+							_iterator10 = w.E[Symbol.iterator]();
 
 						case 5:
-							if (_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done) {
+							if (_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done) {
 								context$4$0.next = 14;
@@ -153,5 +858,5 @@ break;
 
-							_step2$value = _step2.value;
-							u = _step2$value.u;
-							v = _step2$value.v;
+							_step10$value = _step10.value;
+							u = _step10$value.u;
+							v = _step10$value.v;
 							context$4$0.next = 11;
@@ -161,3 +866,3 @@ return u === w ? v : u;
 						case 11:
-							_iteratorNormalCompletion2 = true;
+							_iteratorNormalCompletion10 = true;
 							context$4$0.next = 5;
@@ -173,4 +878,4 @@ break;
 							context$4$0.t0 = context$4$0["catch"](3);
-							_didIteratorError2 = true;
-							_iteratorError2 = context$4$0.t0;
+							_didIteratorError10 = true;
+							_iteratorError10 = context$4$0.t0;
 
@@ -181,4 +886,4 @@ case 20:
 
-							if (!_iteratorNormalCompletion2 && _iterator2["return"]) {
-								_iterator2["return"]();
+							if (!_iteratorNormalCompletion10 && _iterator10["return"]) {
+								_iterator10["return"]();
 							}
@@ -189,3 +894,3 @@
 
-							if (!_didIteratorError2) {
+							if (!_didIteratorError10) {
 								context$4$0.next = 26;
@@ -195,3 +900,3 @@ break;
 
-							throw _iteratorError2;
+							throw _iteratorError10;
 
@@ -211,17 +916,7 @@ case 26:
 
-			Graph.prototype.eitr = regeneratorRuntime.mark(function callee$3$0() {
-				return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
-					while (1) switch (context$4$0.prev = context$4$0.next) {
-						case 0:
-							return context$4$0.delegateYield(this.E, "t0", 1);
+			Graph.prototype.dsitr = Graph.prototype.nitr;
+			Graph.prototype.dpitr = Graph.prototype.nitr;
 
-						case 1:
-						case "end":
-							return context$4$0.stop();
-					}
-				}, callee$3$0, this);
-			});
-
 			Graph.prototype.edges = regeneratorRuntime.mark(function callee$3$0() {
-				var _iteratorNormalCompletion3, _didIteratorError3, _iteratorError3, _iterator3, _step3, e;
+				var _iteratorNormalCompletion11, _didIteratorError11, _iteratorError11, _iterator11, _step11, e;
 
@@ -231,10 +926,10 @@ return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
 						case 0:
-							_iteratorNormalCompletion3 = true;
-							_didIteratorError3 = false;
-							_iteratorError3 = undefined;
+							_iteratorNormalCompletion11 = true;
+							_didIteratorError11 = false;
+							_iteratorError11 = undefined;
 							context$4$0.prev = 3;
-							_iterator3 = this.eitr()[Symbol.iterator]();
+							_iterator11 = this.eitr()[Symbol.iterator]();
 
 						case 5:
-							if (_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done) {
+							if (_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done) {
 								context$4$0.next = 12;
@@ -244,3 +939,3 @@ break;
 
-							e = _step3.value;
+							e = _step11.value;
 							context$4$0.next = 9;
@@ -250,3 +945,3 @@ return [e.u, e.v, e];
 						case 9:
-							_iteratorNormalCompletion3 = true;
+							_iteratorNormalCompletion11 = true;
 							context$4$0.next = 5;
@@ -262,4 +957,4 @@ break;
 							context$4$0.t0 = context$4$0["catch"](3);
-							_didIteratorError3 = true;
-							_iteratorError3 = context$4$0.t0;
+							_didIteratorError11 = true;
+							_iteratorError11 = context$4$0.t0;
 
@@ -270,4 +965,4 @@ case 18:
 
-							if (!_iteratorNormalCompletion3 && _iterator3["return"]) {
-								_iterator3["return"]();
+							if (!_iteratorNormalCompletion11 && _iterator11["return"]) {
+								_iterator11["return"]();
 							}
@@ -278,3 +973,3 @@
 
-							if (!_didIteratorError3) {
+							if (!_didIteratorError11) {
 								context$4$0.next = 24;
@@ -284,3 +979,3 @@ break;
 
-							throw _iteratorError3;
+							throw _iteratorError11;
 
@@ -301,3 +996,3 @@ case 24:
 			Graph.prototype.incident = regeneratorRuntime.mark(function callee$3$0(v) {
-				var _iteratorNormalCompletion4, _didIteratorError4, _iteratorError4, _iterator4, _step4, e;
+				var _iteratorNormalCompletion12, _didIteratorError12, _iteratorError12, _iterator12, _step12, e;
 
@@ -307,10 +1002,10 @@ return regeneratorRuntime.wrap(function callee$3$0$(context$4$0) {
 						case 0:
-							_iteratorNormalCompletion4 = true;
-							_didIteratorError4 = false;
-							_iteratorError4 = undefined;
+							_iteratorNormalCompletion12 = true;
+							_didIteratorError12 = false;
+							_iteratorError12 = undefined;
 							context$4$0.prev = 3;
-							_iterator4 = this.iitr(v)[Symbol.iterator]();
+							_iterator12 = this.iitr(v)[Symbol.iterator]();
 
 						case 5:
-							if (_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done) {
+							if (_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done) {
 								context$4$0.next = 12;
@@ -320,3 +1015,3 @@ break;
 
-							e = _step4.value;
+							e = _step12.value;
 							context$4$0.next = 9;
@@ -326,3 +1021,3 @@ return [e.u, e.v, e];
 						case 9:
-							_iteratorNormalCompletion4 = true;
+							_iteratorNormalCompletion12 = true;
 							context$4$0.next = 5;
@@ -338,4 +1033,4 @@ break;
 							context$4$0.t0 = context$4$0["catch"](3);
-							_didIteratorError4 = true;
-							_iteratorError4 = context$4$0.t0;
+							_didIteratorError12 = true;
+							_iteratorError12 = context$4$0.t0;
 
@@ -346,4 +1041,4 @@ case 18:
 
-							if (!_iteratorNormalCompletion4 && _iterator4["return"]) {
-								_iterator4["return"]();
+							if (!_iteratorNormalCompletion12 && _iterator12["return"]) {
+								_iterator12["return"]();
 							}
@@ -354,3 +1049,3 @@
 
-							if (!_didIteratorError4) {
+							if (!_didIteratorError12) {
 								context$4$0.next = 24;
@@ -360,3 +1055,3 @@ break;
 
-							throw _iteratorError4;
+							throw _iteratorError12;
 
@@ -376,2 +1071,5 @@ case 24:
 
+			Graph.prototype.ingoing = Graph.prototype.incident;
+			Graph.prototype.outgoing = Graph.prototype.incident;
+
 			Graph.prototype.endpoints = function (e) {
@@ -382,6 +1080,11 @@
 
+			/**
+    * O(1)
+    */
+			Graph.prototype.reverse = function () {};
+
 			return Graph;
 		};
 
-		exports.List = List;
+		exports.MultiGraph = MultiGraph;
 
@@ -388,0 +1091,0 @@ /* js/src/Vertex.js */

js/dist/adjacency-list.min.js

@@ -1,2 +0,2 @@
-"use strict";!function(){var e=function(e,t){var r=function(e,t){this.u=e,this.v=t,this.iterator=null,this.uiterator=null,this.viterator=null};e.Edge=r;var n=function(e){var n=function(){this.V=new e,this.E=new e};return n.prototype.vadd=function(){var t=new a(new e);return t.iterator=this.V.push(t),t},n.prototype.vdel=function(e){var r=!0,n=!1,a=t;try{for(var i,o=this.iitr(e)[Symbol.iterator]();!(r=(i=o.next()).done);r=!0){var s=i.value;this.edel(s)}}catch(u){n=!0,a=u}finally{try{!r&&o["return"]&&o["return"]()}finally{if(n)throw a}}this.E.erase(e.iterator)},n.prototype.eadd=function(e,t){var n=new r(e,t);return n.iterator=this.E.push(n),n.uiterator=e.E.push(n),e!==t&&(n.viterator=t.E.push(n)),n},n.prototype.edel=function(e){this.E.erase(e.iterator),e.u.E.erase(e.uiterator),e.u!==e.v&&e.v.E.erase(e.viterator)},n.prototype.vitr=regeneratorRuntime.mark(function i(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.V,"t0",1);case 1:case"end":return e.stop()}},i,this)}),n.prototype.iitr=regeneratorRuntime.mark(function o(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(e.E,"t0",1);case 1:case"end":return t.stop()}},o,this)}),n.prototype.nitr=regeneratorRuntime.mark(function s(e){var r,n,a,i,o,u,c,p;return regeneratorRuntime.wrap(function(s){for(;;)switch(s.prev=s.next){case 0:r=!0,n=!1,a=t,s.prev=3,i=e.E[Symbol.iterator]();case 5:if(r=(o=i.next()).done){s.next=14;break}return u=o.value,c=u.u,p=u.v,s.next=11,c===e?p:c;case 11:r=!0,s.next=5;break;case 14:s.next=20;break;case 16:s.prev=16,s.t0=s["catch"](3),n=!0,a=s.t0;case 20:s.prev=20,s.prev=21,!r&&i["return"]&&i["return"]();case 23:if(s.prev=23,!n){s.next=26;break}throw a;case 26:return s.finish(23);case 27:return s.finish(20);case 28:case"end":return s.stop()}},s,this,[[3,16,20,28],[21,,23,27]])}),n.prototype.eitr=regeneratorRuntime.mark(function u(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.E,"t0",1);case 1:case"end":return e.stop()}},u,this)}),n.prototype.edges=regeneratorRuntime.mark(function c(){var e,r,n,a,i,o;return regeneratorRuntime.wrap(function(s){for(;;)switch(s.prev=s.next){case 0:e=!0,r=!1,n=t,s.prev=3,a=this.eitr()[Symbol.iterator]();case 5:if(e=(i=a.next()).done){s.next=12;break}return o=i.value,s.next=9,[o.u,o.v,o];case 9:e=!0,s.next=5;break;case 12:s.next=18;break;case 14:s.prev=14,s.t0=s["catch"](3),r=!0,n=s.t0;case 18:s.prev=18,s.prev=19,!e&&a["return"]&&a["return"]();case 21:if(s.prev=21,!r){s.next=24;break}throw n;case 24:return s.finish(21);case 25:return s.finish(18);case 26:case"end":return s.stop()}},c,this,[[3,14,18,26],[19,,21,25]])}),n.prototype.incident=regeneratorRuntime.mark(function p(e){var r,n,a,i,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,a=t,u.prev=3,i=this.iitr(e)[Symbol.iterator]();case 5:if(r=(o=i.next()).done){u.next=12;break}return s=o.value,u.next=9,[s.u,s.v,s];case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,a=u.t0;case 18:u.prev=18,u.prev=19,!r&&i["return"]&&i["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw a;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},p,this,[[3,14,18,26],[19,,21,25]])}),n.prototype.endpoints=function(e){return[e.u,e.v]},n};e.List=n;var a=function(e){this.iterator=null,this.E=e};return e.Vertex=a,e};"object"==typeof exports?e(exports):"function"==typeof define&&define.amd?define("aureooms-js-adjacency-list",[],function(){return e({})}):"object"==typeof window&&"object"==typeof window.document?e(window.adjacencylist={}):console.error("unable to detect type of module to define for aureooms-js-adjacency-list")}();
+"use strict";var _slicedToArray=function(){function e(e,t){var r=[],n=!0,i=!1,a=void 0;try{for(var o,s=e[Symbol.iterator]();!(n=(o=s.next()).done)&&(r.push(o.value),!t||r.length!==t);n=!0);}catch(u){i=!0,a=u}finally{try{!n&&s["return"]&&s["return"]()}finally{if(i)throw a}}return r}return function(t,r){if(Array.isArray(t))return t;if(Symbol.iterator in Object(t))return e(t,r);throw new TypeError("Invalid attempt to destructure non-iterable instance")}}();!function(){var e=function(e,t){var r=function(e,t,r){this.u=e,this.v=t,this.iterator=null,this.twin=null,this.list=r};e.DiEdge=r;var n=function(){this.iterator=null};e.DiVertex=n;var i=function(e,t){this.u=e,this.v=t,this.iterator=null,this.uiterator=null,this.viterator=null};e.Edge=i;var a=function(e,i){var a=function(){this.V=new e,this.succ=new i,this.pred=new i};return a.prototype.vadd=function(){var t=new n;return this.succ.set(t,new e),this.pred.set(t,new e),t.iterator=this.V.push(t),t},a.prototype.vdel=function(e){var r=!0,n=!1,i=t;try{for(var a,o=this.initr(e)[Symbol.iterator]();!(r=(a=o.next()).done);r=!0){var s=a.value;this.edel(s)}}catch(u){n=!0,i=u}finally{try{!r&&o["return"]&&o["return"]()}finally{if(n)throw i}}var c=!0,p=!1,h=t;try{for(var f,v=this.outitr(e)[Symbol.iterator]();!(c=(f=v.next()).done);c=!0){var s=f.value;this.edel(s)}}catch(u){p=!0,h=u}finally{try{!c&&v["return"]&&v["return"]()}finally{if(p)throw h}}this.pred["delete"](e),this.succ["delete"](e),this.V.erase(e.iterator)},a.prototype.eadd=function(e,t){var n=new r(e,t,this.succ),i=new r(t,e,this.pred);return n.iterator=this.succ.get(e).push(n),i.iterator=this.pred.get(t).push(i),n.twin=i,i.twin=n,n},a.prototype.edel=function(e){e.list.erase(e.iterator),e.twin.list.erase(e.twin.iterator)},a.prototype.vitr=regeneratorRuntime.mark(function o(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.V,"t0",1);case 1:case"end":return e.stop()}},o,this)}),a.prototype.eitr=regeneratorRuntime.mark(function s(){var e,r,n,i,a,o,u,c;return regeneratorRuntime.wrap(function(s){for(;;)switch(s.prev=s.next){case 0:e=!0,r=!1,n=t,s.prev=3,i=this.succ[Symbol.iterator]();case 5:if(e=(a=i.next()).done){s.next=13;break}return o=_slicedToArray(a.value,2),u=o[0],c=o[1],s.delegateYield(c,"t0",10);case 10:e=!0,s.next=5;break;case 13:s.next=19;break;case 15:s.prev=15,s.t1=s["catch"](3),r=!0,n=s.t1;case 19:s.prev=19,s.prev=20,!e&&i["return"]&&i["return"]();case 22:if(s.prev=22,!r){s.next=25;break}throw n;case 25:return s.finish(22);case 26:return s.finish(19);case 27:case"end":return s.stop()}},s,this,[[3,15,19,27],[20,,22,26]])}),a.prototype.iitr=regeneratorRuntime.mark(function u(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.initr(e),"t0",1);case 1:return t.delegateYield(this.outitr(e),"t1",2);case 2:case"end":return t.stop()}},u,this)}),a.prototype.initr=regeneratorRuntime.mark(function c(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.pred.get(e),"t0",1);case 1:case"end":return t.stop()}},c,this)}),a.prototype.outitr=regeneratorRuntime.mark(function p(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.succ.get(e),"t0",1);case 1:case"end":return t.stop()}},p,this)}),a.prototype.nitr=regeneratorRuntime.mark(function h(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.dsitr(e),"t0",1);case 1:return t.delegateYield(this.dpitr(e),"t1",2);case 2:case"end":return t.stop()}},h,this)}),a.prototype.dsitr=regeneratorRuntime.mark(function f(e){var r,n,i,a,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=this.succ.get(e)[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=12;break}return s=o.value.v,u.next=9,s;case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,i=u.t0;case 18:u.prev=18,u.prev=19,!r&&a["return"]&&a["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw i;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},f,this,[[3,14,18,26],[19,,21,25]])}),a.prototype.dpitr=regeneratorRuntime.mark(function v(e){var r,n,i,a,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=this.pred.get(e)[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=12;break}return s=o.value.v,u.next=9,s;case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,i=u.t0;case 18:u.prev=18,u.prev=19,!r&&a["return"]&&a["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw i;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},v,this,[[3,14,18,26],[19,,21,25]])}),a.prototype.edges=regeneratorRuntime.mark(function d(){var e,r,n,i,a,o;return regeneratorRuntime.wrap(function(s){for(;;)switch(s.prev=s.next){case 0:e=!0,r=!1,n=t,s.prev=3,i=this.eitr()[Symbol.iterator]();case 5:if(e=(a=i.next()).done){s.next=12;break}return o=a.value,s.next=9,[o.u,o.v,o];case 9:e=!0,s.next=5;break;case 12:s.next=18;break;case 14:s.prev=14,s.t0=s["catch"](3),r=!0,n=s.t0;case 18:s.prev=18,s.prev=19,!e&&i["return"]&&i["return"]();case 21:if(s.prev=21,!r){s.next=24;break}throw n;case 24:return s.finish(21);case 25:return s.finish(18);case 26:case"end":return s.stop()}},d,this,[[3,14,18,26],[19,,21,25]])}),a.prototype.incident=regeneratorRuntime.mark(function l(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.ingoing(e),"t0",1);case 1:return t.delegateYield(this.outgoing(e),"t1",2);case 2:case"end":return t.stop()}},l,this)}),a.prototype.ingoing=regeneratorRuntime.mark(function y(e){var r,n,i,a,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=this.initr(e)[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=12;break}return s=o.value,u.next=9,[s.u,s.v,s];case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,i=u.t0;case 18:u.prev=18,u.prev=19,!r&&a["return"]&&a["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw i;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},y,this,[[3,14,18,26],[19,,21,25]])}),a.prototype.outgoing=regeneratorRuntime.mark(function x(e){var r,n,i,a,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=this.outitr(e)[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=12;break}return s=o.value,u.next=9,[s.u,s.v,s];case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,i=u.t0;case 18:u.prev=18,u.prev=19,!r&&a["return"]&&a["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw i;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},x,this,[[3,14,18,26],[19,,21,25]])}),a.prototype.endpoints=function(e){return[e.u,e.v]},a.prototype.reverse=function(){var e=[this.pred,this.succ];return this.succ=e[0],this.pred=e[1],this},a};e.MultiDiGraph=a;var o=function(e){var r=function(){this.V=new e,this.E=new e};return r.prototype.vadd=function(){var t=new s(new e);return t.iterator=this.V.push(t),t},r.prototype.vdel=function(e){var r=!0,n=!1,i=t;try{for(var a,o=this.iitr(e)[Symbol.iterator]();!(r=(a=o.next()).done);r=!0){var s=a.value;this.edel(s)}}catch(u){n=!0,i=u}finally{try{!r&&o["return"]&&o["return"]()}finally{if(n)throw i}}this.V.erase(e.iterator)},r.prototype.eadd=function(e,t){var r=new i(e,t);return r.iterator=this.E.push(r),r.uiterator=e.E.push(r),e!==t&&(r.viterator=t.E.push(r)),r},r.prototype.edel=function(e){this.E.erase(e.iterator),e.u.E.erase(e.uiterator),e.u!==e.v&&e.v.E.erase(e.viterator)},r.prototype.vitr=regeneratorRuntime.mark(function n(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.V,"t0",1);case 1:case"end":return e.stop()}},n,this)}),r.prototype.eitr=regeneratorRuntime.mark(function a(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.E,"t0",1);case 1:case"end":return e.stop()}},a,this)}),r.prototype.iitr=regeneratorRuntime.mark(function o(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(e.E,"t0",1);case 1:case"end":return t.stop()}},o,this)}),r.prototype.initr=r.prototype.iitr,r.prototype.outitr=r.prototype.iitr,r.prototype.nitr=regeneratorRuntime.mark(function u(e){var r,n,i,a,o,s,c,p;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=e.E[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=14;break}return s=o.value,c=s.u,p=s.v,u.next=11,c===e?p:c;case 11:r=!0,u.next=5;break;case 14:u.next=20;break;case 16:u.prev=16,u.t0=u["catch"](3),n=!0,i=u.t0;case 20:u.prev=20,u.prev=21,!r&&a["return"]&&a["return"]();case 23:if(u.prev=23,!n){u.next=26;break}throw i;case 26:return u.finish(23);case 27:return u.finish(20);case 28:case"end":return u.stop()}},u,this,[[3,16,20,28],[21,,23,27]])}),r.prototype.dsitr=r.prototype.nitr,r.prototype.dpitr=r.prototype.nitr,r.prototype.edges=regeneratorRuntime.mark(function c(){var e,r,n,i,a,o;return regeneratorRuntime.wrap(function(s){for(;;)switch(s.prev=s.next){case 0:e=!0,r=!1,n=t,s.prev=3,i=this.eitr()[Symbol.iterator]();case 5:if(e=(a=i.next()).done){s.next=12;break}return o=a.value,s.next=9,[o.u,o.v,o];case 9:e=!0,s.next=5;break;case 12:s.next=18;break;case 14:s.prev=14,s.t0=s["catch"](3),r=!0,n=s.t0;case 18:s.prev=18,s.prev=19,!e&&i["return"]&&i["return"]();case 21:if(s.prev=21,!r){s.next=24;break}throw n;case 24:return s.finish(21);case 25:return s.finish(18);case 26:case"end":return s.stop()}},c,this,[[3,14,18,26],[19,,21,25]])}),r.prototype.incident=regeneratorRuntime.mark(function p(e){var r,n,i,a,o,s;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:r=!0,n=!1,i=t,u.prev=3,a=this.iitr(e)[Symbol.iterator]();case 5:if(r=(o=a.next()).done){u.next=12;break}return s=o.value,u.next=9,[s.u,s.v,s];case 9:r=!0,u.next=5;break;case 12:u.next=18;break;case 14:u.prev=14,u.t0=u["catch"](3),n=!0,i=u.t0;case 18:u.prev=18,u.prev=19,!r&&a["return"]&&a["return"]();case 21:if(u.prev=21,!n){u.next=24;break}throw i;case 24:return u.finish(21);case 25:return u.finish(18);case 26:case"end":return u.stop()}},p,this,[[3,14,18,26],[19,,21,25]])}),r.prototype.ingoing=r.prototype.incident,r.prototype.outgoing=r.prototype.incident,r.prototype.endpoints=function(e){return[e.u,e.v]},r.prototype.reverse=function(){},r};e.MultiGraph=o;var s=function(e){this.iterator=null,this.E=e};return e.Vertex=s,e};"object"==typeof exports?e(exports):"function"==typeof define&&define.amd?define("aureooms-js-adjacency-list",[],function(){return e({})}):"object"==typeof window&&"object"==typeof window.document?e(window.adjacencylist={}):console.error("unable to detect type of module to define for aureooms-js-adjacency-list")}();
 //# sourceMappingURL=js/dist/adjacency-list.js.map

package.json

 {
 	"main": "js/dist/adjacency-list.js",
-	"version": "2.0.1",
+	"version": "3.0.0",
 	"bugs": {
@@ -5,0 +5,0 @@ "url": "https://github.com/aureooms/js-adjacency-list/issues"

README.md

@@ -7,2 +7,6 @@ [js-adjacency-list](http://aureooms.github.io/js-adjacency-list)
 
+```js
+for ( let e of E( G ) ) ... ;
+```
+
 [![NPM license](http://img.shields.io/npm/l/aureooms-js-adjacency-list.svg?style=flat)](https://raw.githubusercontent.com/aureooms/js-adjacency-list/master/LICENSE)
@@ -98,1 +102,32 @@ [![NPM version](http://img.shields.io/npm/v/aureooms-js-adjacency-list.svg?style=flat)](https://www.npmjs.org/package/aureooms-js-adjacency-list)
 ```
+
+## Use
+
+
+```js
+let dll = require( "aureooms-js-dll" ) ;
+
+let Graph = adjacencylist.List( dll.DoublyLinkedList ) ;
+
+let { V , E , N } = require( "aureooms-js-graph-theory-notation" ) ;
+
+let G = new Graph( ) ;
+
+let u = G.vadd( ) ;
+
+let v = G.vadd( ) ;
+
+let e = G.eadd( u , v ) ;
+
+for ( let w of V( G ) ) ... ;
+
+for ( let e of E( G ) ) ... ;
+
+for ( let w of N( G , u ) ) ... ;
+
+G.edel( e ) ;
+
+G.vdel( v ) ;
+
+G.vdel( u ) ;
+```

test/js/src/spec.js

@@ -6,3 +6,3 @@
 
-spec.undirected1( "List" , adjacencylist.List( dll.DoublyLinkedList ) ) ;
-spec.undirected2( "List" , adjacencylist.List( dll.DoublyLinkedList ) ) ;
+spec.undirected1( "MultiGraph" , adjacencylist.MultiGraph( dll.DoublyLinkedList ) ) ;
+spec.undirected2( "MultiGraph" , adjacencylist.MultiGraph( dll.DoublyLinkedList ) ) ;

New alerts

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

102849

increased by64.66%

Number of package files

24

increased by14.29%

Lines of code

1191

increased by160.61%

Number of lines in readme file

132

increased by36.08%

Worsened metrics

Number of medium supply chain risk alerts

1

increased byInfinity%

No dependency changes