@dagrejs/dagre 1.1.0 → 1.1.1

package/dist/dagre.js

@@ -1309,7 +1309,12 @@ module.exports = order;
  *    1. Graph nodes will have an "order" attribute based on the results of the
  *       algorithm.
  */
-function order(g) {
+function order(g, opts) {
+  if (opts && typeof opts.customOrder === 'function') {
+    opts.customOrder(g, order);
+    return;
+  }
+
   let maxRank = util.maxRank(g),
     downLayerGraphs = buildLayerGraphs(g, util.range(1, maxRank + 1), "inEdges"),
     upLayerGraphs = buildLayerGraphs(g, util.range(maxRank - 1, -1, -1), "outEdges");
@@ -1317,6 +1322,10 @@ function order(g) {
   let layering = initOrder(g);
   assignOrder(g, layering);
 
+  if (opts && opts.disableOptimalOrderHeuristic) {
+    return;
+  }
+
   let bestCC = Number.POSITIVE_INFINITY,
     best;
 
@@ -1810,7 +1819,8 @@ function findType1Conflicts(g, layering) {
     return layer;
   }
 
-  layering.reduce(visitLayer);
+  layering.length && layering.reduce(visitLayer);
+
   return conflicts;
 }
 
@@ -1855,7 +1865,8 @@ function findType2Conflicts(g, layering) {
     return south;
   }
 
-  layering.reduce(visitLayer);
+  layering.length && layering.reduce(visitLayer);
+
   return conflicts;
 }
 
@@ -2948,7 +2959,7 @@ function zipObject(props, values) {
 }
 
 },{"@dagrejs/graphlib":29}],28:[function(require,module,exports){
-module.exports = "1.0.4";
+module.exports = "1.1.1";
 
 },{}],29:[function(require,module,exports){
 /**
@@ -4342,7 +4353,7 @@ function read(json) {
 }
 
 },{"./graph":44}],47:[function(require,module,exports){
-module.exports = '2.1.13';
+module.exports = '2.2.1';
 
 },{}]},{},[1])(1)
 });

package/dist/dagre.min.js

@@ -207,7 +207,7 @@ let cc=0;southEntries.forEach(entry=>{let index=entry.pos+firstIndex;tree[index]
  *
  *    1. Graph nodes will have an "order" attribute based on the results of the
  *       algorithm.
- */function order(g){let maxRank=util.maxRank(g),downLayerGraphs=buildLayerGraphs(g,util.range(1,maxRank+1),"inEdges"),upLayerGraphs=buildLayerGraphs(g,util.range(maxRank-1,-1,-1),"outEdges");let layering=initOrder(g);assignOrder(g,layering);let bestCC=Number.POSITIVE_INFINITY,best;for(let i=0,lastBest=0;lastBest<4;++i,++lastBest){sweepLayerGraphs(i%2?downLayerGraphs:upLayerGraphs,i%4>=2);layering=util.buildLayerMatrix(g);let cc=crossCount(g,layering);if(cc<bestCC){lastBest=0;best=Object.assign({},layering);bestCC=cc}}assignOrder(g,best)}function buildLayerGraphs(g,ranks,relationship){return ranks.map(function(rank){return buildLayerGraph(g,rank,relationship)})}function sweepLayerGraphs(layerGraphs,biasRight){let cg=new Graph;layerGraphs.forEach(function(lg){let root=lg.graph().root;let sorted=sortSubgraph(lg,root,cg,biasRight);sorted.vs.forEach((v,i)=>lg.node(v).order=i);addSubgraphConstraints(lg,cg,sorted.vs)})}function assignOrder(g,layering){Object.values(layering).forEach(layer=>layer.forEach((v,i)=>g.node(v).order=i))}},{"../util":27,"./add-subgraph-constraints":11,"./build-layer-graph":13,"./cross-count":14,"./init-order":16,"./sort-subgraph":18,"@dagrejs/graphlib":29}],16:[function(require,module,exports){"use strict";let util=require("../util");module.exports=initOrder;
+ */function order(g,opts){if(opts&&typeof opts.customOrder==="function"){opts.customOrder(g,order);return}let maxRank=util.maxRank(g),downLayerGraphs=buildLayerGraphs(g,util.range(1,maxRank+1),"inEdges"),upLayerGraphs=buildLayerGraphs(g,util.range(maxRank-1,-1,-1),"outEdges");let layering=initOrder(g);assignOrder(g,layering);if(opts&&opts.disableOptimalOrderHeuristic){return}let bestCC=Number.POSITIVE_INFINITY,best;for(let i=0,lastBest=0;lastBest<4;++i,++lastBest){sweepLayerGraphs(i%2?downLayerGraphs:upLayerGraphs,i%4>=2);layering=util.buildLayerMatrix(g);let cc=crossCount(g,layering);if(cc<bestCC){lastBest=0;best=Object.assign({},layering);bestCC=cc}}assignOrder(g,best)}function buildLayerGraphs(g,ranks,relationship){return ranks.map(function(rank){return buildLayerGraph(g,rank,relationship)})}function sweepLayerGraphs(layerGraphs,biasRight){let cg=new Graph;layerGraphs.forEach(function(lg){let root=lg.graph().root;let sorted=sortSubgraph(lg,root,cg,biasRight);sorted.vs.forEach((v,i)=>lg.node(v).order=i);addSubgraphConstraints(lg,cg,sorted.vs)})}function assignOrder(g,layering){Object.values(layering).forEach(layer=>layer.forEach((v,i)=>g.node(v).order=i))}},{"../util":27,"./add-subgraph-constraints":11,"./build-layer-graph":13,"./cross-count":14,"./init-order":16,"./sort-subgraph":18,"@dagrejs/graphlib":29}],16:[function(require,module,exports){"use strict";let util=require("../util");module.exports=initOrder;
 /*
  * Assigns an initial order value for each node by performing a DFS search
  * starting from nodes in the first rank. Nodes are assigned an order in their
@@ -277,7 +277,7 @@ parent=w;while((parent=g.parent(parent))!==lca){wPath.push(parent)}return{path:v
 k0=0,
 // Tracks the last node in this layer scanned for crossings with a type-1
 // segment.
-scanPos=0,prevLayerLength=prevLayer.length,lastNode=layer[layer.length-1];layer.forEach((v,i)=>{let w=findOtherInnerSegmentNode(g,v),k1=w?g.node(w).order:prevLayerLength;if(w||v===lastNode){layer.slice(scanPos,i+1).forEach(scanNode=>{g.predecessors(scanNode).forEach(u=>{let uLabel=g.node(u),uPos=uLabel.order;if((uPos<k0||k1<uPos)&&!(uLabel.dummy&&g.node(scanNode).dummy)){addConflict(conflicts,u,scanNode)}})});scanPos=i+1;k0=k1}});return layer}layering.reduce(visitLayer);return conflicts}function findType2Conflicts(g,layering){let conflicts={};function scan(south,southPos,southEnd,prevNorthBorder,nextNorthBorder){let v;util.range(southPos,southEnd).forEach(i=>{v=south[i];if(g.node(v).dummy){g.predecessors(v).forEach(u=>{let uNode=g.node(u);if(uNode.dummy&&(uNode.order<prevNorthBorder||uNode.order>nextNorthBorder)){addConflict(conflicts,u,v)}})}})}function visitLayer(north,south){let prevNorthPos=-1,nextNorthPos,southPos=0;south.forEach((v,southLookahead)=>{if(g.node(v).dummy==="border"){let predecessors=g.predecessors(v);if(predecessors.length){nextNorthPos=g.node(predecessors[0]).order;scan(south,southPos,southLookahead,prevNorthPos,nextNorthPos);southPos=southLookahead;prevNorthPos=nextNorthPos}}scan(south,southPos,south.length,nextNorthPos,north.length)});return south}layering.reduce(visitLayer);return conflicts}function findOtherInnerSegmentNode(g,v){if(g.node(v).dummy){return g.predecessors(v).find(u=>g.node(u).dummy)}}function addConflict(conflicts,v,w){if(v>w){let tmp=v;v=w;w=tmp}let conflictsV=conflicts[v];if(!conflictsV){conflicts[v]=conflictsV={}}conflictsV[w]=true}function hasConflict(conflicts,v,w){if(v>w){let tmp=v;v=w;w=tmp}return!!conflicts[v]&&conflicts[v].hasOwnProperty(w)}
+scanPos=0,prevLayerLength=prevLayer.length,lastNode=layer[layer.length-1];layer.forEach((v,i)=>{let w=findOtherInnerSegmentNode(g,v),k1=w?g.node(w).order:prevLayerLength;if(w||v===lastNode){layer.slice(scanPos,i+1).forEach(scanNode=>{g.predecessors(scanNode).forEach(u=>{let uLabel=g.node(u),uPos=uLabel.order;if((uPos<k0||k1<uPos)&&!(uLabel.dummy&&g.node(scanNode).dummy)){addConflict(conflicts,u,scanNode)}})});scanPos=i+1;k0=k1}});return layer}layering.length&&layering.reduce(visitLayer);return conflicts}function findType2Conflicts(g,layering){let conflicts={};function scan(south,southPos,southEnd,prevNorthBorder,nextNorthBorder){let v;util.range(southPos,southEnd).forEach(i=>{v=south[i];if(g.node(v).dummy){g.predecessors(v).forEach(u=>{let uNode=g.node(u);if(uNode.dummy&&(uNode.order<prevNorthBorder||uNode.order>nextNorthBorder)){addConflict(conflicts,u,v)}})}})}function visitLayer(north,south){let prevNorthPos=-1,nextNorthPos,southPos=0;south.forEach((v,southLookahead)=>{if(g.node(v).dummy==="border"){let predecessors=g.predecessors(v);if(predecessors.length){nextNorthPos=g.node(predecessors[0]).order;scan(south,southPos,southLookahead,prevNorthPos,nextNorthPos);southPos=southLookahead;prevNorthPos=nextNorthPos}}scan(south,southPos,south.length,nextNorthPos,north.length)});return south}layering.length&&layering.reduce(visitLayer);return conflicts}function findOtherInnerSegmentNode(g,v){if(g.node(v).dummy){return g.predecessors(v).find(u=>g.node(u).dummy)}}function addConflict(conflicts,v,w){if(v>w){let tmp=v;v=w;w=tmp}let conflictsV=conflicts[v];if(!conflictsV){conflicts[v]=conflictsV={}}conflictsV[w]=true}function hasConflict(conflicts,v,w){if(v>w){let tmp=v;v=w;w=tmp}return!!conflicts[v]&&conflicts[v].hasOwnProperty(w)}
 /*
  * Try to align nodes into vertical "blocks" where possible. This algorithm
  * attempts to align a node with one of its median neighbors. If the edge
@@ -495,7 +495,7 @@ let offset=Math.min(...g.nodes().map(v=>g.node(v).rank));let layers=[];g.nodes()
 /*
  * Returns a new function that wraps `fn` with a timer. The wrapper logs the
  * time it takes to execute the function.
- */function time(name,fn){let start=Date.now();try{return fn()}finally{console.log(name+" time: "+(Date.now()-start)+"ms")}}function notime(name,fn){return fn()}let idCounter=0;function uniqueId(prefix){var id=++idCounter;return toString(prefix)+id}function range(start,limit,step=1){if(limit==null){limit=start;start=0}let endCon=i=>i<limit;if(step<0){endCon=i=>limit<i}const range=[];for(let i=start;endCon(i);i+=step){range.push(i)}return range}function pick(source,keys){const dest={};for(const key of keys){if(source[key]!==undefined){dest[key]=source[key]}}return dest}function mapValues(obj,funcOrProp){let func=funcOrProp;if(typeof funcOrProp==="string"){func=val=>val[funcOrProp]}return Object.entries(obj).reduce((acc,[k,v])=>{acc[k]=func(v,k);return acc},{})}function zipObject(props,values){return props.reduce((acc,key,i)=>{acc[key]=values[i];return acc},{})}},{"@dagrejs/graphlib":29}],28:[function(require,module,exports){module.exports="1.0.4"},{}],29:[function(require,module,exports){
+ */function time(name,fn){let start=Date.now();try{return fn()}finally{console.log(name+" time: "+(Date.now()-start)+"ms")}}function notime(name,fn){return fn()}let idCounter=0;function uniqueId(prefix){var id=++idCounter;return toString(prefix)+id}function range(start,limit,step=1){if(limit==null){limit=start;start=0}let endCon=i=>i<limit;if(step<0){endCon=i=>limit<i}const range=[];for(let i=start;endCon(i);i+=step){range.push(i)}return range}function pick(source,keys){const dest={};for(const key of keys){if(source[key]!==undefined){dest[key]=source[key]}}return dest}function mapValues(obj,funcOrProp){let func=funcOrProp;if(typeof funcOrProp==="string"){func=val=>val[funcOrProp]}return Object.entries(obj).reduce((acc,[k,v])=>{acc[k]=func(v,k);return acc},{})}function zipObject(props,values){return props.reduce((acc,key,i)=>{acc[key]=values[i];return acc},{})}},{"@dagrejs/graphlib":29}],28:[function(require,module,exports){module.exports="1.1.1"},{}],29:[function(require,module,exports){
 /**
  * Copyright (c) 2014, Chris Pettitt
  * All rights reserved.
@@ -798,4 +798,4 @@ module.exports={Graph:require("./graph"),version:require("./version")}},{"./grap
  * // ['a', 'b']
  * g2.edges()
  * // [ { v: 'a', w: 'b' } ]
- */function read(json){var g=new Graph(json.options).setGraph(json.value);json.nodes.forEach(function(entry){g.setNode(entry.v,entry.value);if(entry.parent){g.setParent(entry.v,entry.parent)}});json.edges.forEach(function(entry){g.setEdge({v:entry.v,w:entry.w,name:entry.name},entry.value)});return g}},{"./graph":44}],47:[function(require,module,exports){module.exports="2.1.13"},{}]},{},[1])(1)});
+ */function read(json){var g=new Graph(json.options).setGraph(json.value);json.nodes.forEach(function(entry){g.setNode(entry.v,entry.value);if(entry.parent){g.setParent(entry.v,entry.parent)}});json.edges.forEach(function(entry){g.setEdge({v:entry.v,w:entry.w,name:entry.name},entry.value)});return g}},{"./graph":44}],47:[function(require,module,exports){module.exports="2.2.1"},{}]},{},[1])(1)});

package/lib/acyclic.js

@@ -1,32 +1,37 @@
 "use strict";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.run = run;
-exports.undo = undo;
-var _greedyFas = _interopRequireDefault(require("./greedy-fas.js"));
-var _util = require("./util.js");
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+let greedyFAS = require("./greedy-fas");
+let uniqueId = require("./util").uniqueId;
+
+module.exports = {
+  run: run,
+  undo: undo
+};
+
 function run(g) {
-  let fas = g.graph().acyclicer === "greedy" ? (0, _greedyFas.default)(g, weightFn(g)) : dfsFAS(g);
+  let fas = (g.graph().acyclicer === "greedy"
+    ? greedyFAS(g, weightFn(g))
+    : dfsFAS(g));
   fas.forEach(e => {
     let label = g.edge(e);
     g.removeEdge(e);
     label.forwardName = e.name;
     label.reversed = true;
-    g.setEdge(e.w, e.v, label, (0, _util.uniqueId)("rev"));
+    g.setEdge(e.w, e.v, label, uniqueId("rev"));
   });
+
   function weightFn(g) {
     return e => {
       return g.edge(e).weight;
     };
   }
 }
+
 function dfsFAS(g) {
   let fas = [];
   let stack = {};
   let visited = {};
+
   function dfs(v) {
     if (visited.hasOwnProperty(v)) {
       return;
@@ -42,14 +47,17 @@ function dfsFAS(g) {
     });
     delete stack[v];
   }
+
   g.nodes().forEach(dfs);
   return fas;
 }
+
 function undo(g) {
   g.edges().forEach(e => {
     let label = g.edge(e);
     if (label.reversed) {
       g.removeEdge(e);
+
       let forwardName = label.forwardName;
       delete label.reversed;
       delete label.forwardName;

package/lib/add-border-segments.js

@@ -1,12 +1,7 @@
-"use strict";
+let util = require("./util");
+
+module.exports = addBorderSegments;
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = addBorderSegments;
-var util = _interopRequireWildcard(require("./util.js"));
-function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
-function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 function addBorderSegments(g) {
   function dfs(v) {
     let children = g.children(v);
@@ -14,32 +9,29 @@ function addBorderSegments(g) {
     if (children.length) {
       children.forEach(dfs);
     }
+
     if (node.hasOwnProperty("minRank")) {
       node.borderLeft = [];
       node.borderRight = [];
-      for (let rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {
+      for (let rank = node.minRank, maxRank = node.maxRank + 1;
+        rank < maxRank;
+        ++rank) {
         addBorderNode(g, "borderLeft", "_bl", v, node, rank);
         addBorderNode(g, "borderRight", "_br", v, node, rank);
       }
     }
   }
+
   g.children().forEach(dfs);
 }
+
 function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
-  let label = {
-    width: 0,
-    height: 0,
-    rank: rank,
-    borderType: prop
-  };
+  let label = { width: 0, height: 0, rank: rank, borderType: prop };
   let prev = sgNode[prop][rank - 1];
   let curr = util.addDummyNode(g, "border", label, prefix);
   sgNode[prop][rank] = curr;
   g.setParent(curr, sg);
   if (prev) {
-    g.setEdge(prev, curr, {
-      weight: 1
-    });
+    g.setEdge(prev, curr, { weight: 1 });
   }
 }
-module.exports = exports.default;

package/lib/coordinate-system.js

@@ -1,37 +1,43 @@
 "use strict";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.adjust = adjust;
-exports.undo = undo;
+module.exports = {
+  adjust: adjust,
+  undo: undo
+};
+
 function adjust(g) {
   let rankDir = g.graph().rankdir.toLowerCase();
   if (rankDir === "lr" || rankDir === "rl") {
     swapWidthHeight(g);
   }
 }
+
 function undo(g) {
   let rankDir = g.graph().rankdir.toLowerCase();
   if (rankDir === "bt" || rankDir === "rl") {
     reverseY(g);
   }
+
   if (rankDir === "lr" || rankDir === "rl") {
     swapXY(g);
     swapWidthHeight(g);
   }
 }
+
 function swapWidthHeight(g) {
   g.nodes().forEach(v => swapWidthHeightOne(g.node(v)));
   g.edges().forEach(e => swapWidthHeightOne(g.edge(e)));
 }
+
 function swapWidthHeightOne(attrs) {
   let w = attrs.width;
   attrs.width = attrs.height;
   attrs.height = w;
 }
+
 function reverseY(g) {
   g.nodes().forEach(v => reverseYOne(g.node(v)));
+
   g.edges().forEach(e => {
     let edge = g.edge(e);
     edge.points.forEach(reverseYOne);
@@ -40,11 +46,14 @@ function reverseY(g) {
     }
   });
 }
+
 function reverseYOne(attrs) {
   attrs.y = -attrs.y;
 }
+
 function swapXY(g) {
   g.nodes().forEach(v => swapXYOne(g.node(v)));
+
   g.edges().forEach(e => {
     let edge = g.edge(e);
     edge.points.forEach(swapXYOne);
@@ -53,6 +62,7 @@ function swapXY(g) {
     }
   });
 }
+
 function swapXYOne(attrs) {
   let x = attrs.x;
   attrs.x = attrs.y;

package/lib/data/list.js

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
 /*
  * Simple doubly linked list implementation derived from Cormen, et al.,
  * "Introduction to Algorithms".
@@ -15,6 +9,7 @@ class List {
     sentinel._next = sentinel._prev = sentinel;
     this._sentinel = sentinel;
   }
+
   dequeue() {
     let sentinel = this._sentinel;
     let entry = sentinel._prev;
@@ -23,6 +18,7 @@ class List {
       return entry;
     }
   }
+
   enqueue(entry) {
     let sentinel = this._sentinel;
     if (entry._prev && entry._next) {
@@ -33,6 +29,7 @@ class List {
     sentinel._next = entry;
     entry._prev = sentinel;
   }
+
   toString() {
     let strs = [];
     let sentinel = this._sentinel;
@@ -44,16 +41,18 @@ class List {
     return "[" + strs.join(", ") + "]";
   }
 }
-exports.default = List;
+
 function unlink(entry) {
   entry._prev._next = entry._next;
   entry._next._prev = entry._prev;
   delete entry._next;
   delete entry._prev;
 }
+
 function filterOutLinks(k, v) {
   if (k !== "_next" && k !== "_prev") {
     return v;
   }
 }
-module.exports = exports.default;
+
+module.exports = List;

package/lib/debug.js

@@ -1,42 +1,31 @@
-"use strict";
+let util = require("./util");
+let Graph = require("@dagrejs/graphlib").Graph;
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = debugOrdering;
-var util = _interopRequireWildcard(require("./util.js"));
-var _graphlib = require("@dagrejs/graphlib");
-function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
-function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
-// web-devs write a <script type="importmap"> to map
-// nodejs paths to actual http://paths
+module.exports = {
+  debugOrdering: debugOrdering
+};
 
 /* istanbul ignore next */
 function debugOrdering(g) {
   let layerMatrix = util.buildLayerMatrix(g);
-  let h = new _graphlib.Graph({
-    compound: true,
-    multigraph: true
-  }).setGraph({});
+
+  let h = new Graph({ compound: true, multigraph: true }).setGraph({});
+
   g.nodes().forEach(v => {
-    h.setNode(v, {
-      label: v
-    });
+    h.setNode(v, { label: v });
     h.setParent(v, "layer" + g.node(v).rank);
   });
+
   g.edges().forEach(e => h.setEdge(e.v, e.w, {}, e.name));
+
   layerMatrix.forEach((layer, i) => {
     let layerV = "layer" + i;
-    h.setNode(layerV, {
-      rank: "same"
-    });
+    h.setNode(layerV, { rank: "same" });
     layer.reduce((u, v) => {
-      h.setEdge(u, v, {
-        style: "invis"
-      });
+      h.setEdge(u, v, { style: "invis" });
       return v;
     });
   });
+
   return h;
 }
-module.exports = exports.default;

package/lib/greedy-fas.js

@@ -1,14 +1,5 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = greedyFAS;
-var _graphlib = require("@dagrejs/graphlib");
-var _list = _interopRequireDefault(require("./data/list.js"));
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-// web-devs write a <script type="importmap"> to map
-// nodejs paths to actual http://paths
+let Graph = require("@dagrejs/graphlib").Graph;
+let List = require("./data/list");
 
 /*
  * A greedy heuristic for finding a feedback arc set for a graph. A feedback
@@ -17,8 +8,10 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
  * effective heuristic for the feedback arc set problem." This implementation
  * adjusts that from the paper to allow for weighted edges.
  */
+module.exports = greedyFAS;
 
 let DEFAULT_WEIGHT_FN = () => 1;
+
 function greedyFAS(g, weightFn) {
   if (g.nodeCount() <= 1) {
     return [];
@@ -29,18 +22,16 @@ function greedyFAS(g, weightFn) {
   // Expand multi-edges
   return results.flatMap(e => g.outEdges(e.v, e.w));
 }
+
 function doGreedyFAS(g, buckets, zeroIdx) {
   let results = [];
   let sources = buckets[buckets.length - 1];
   let sinks = buckets[0];
+
   let entry;
   while (g.nodeCount()) {
-    while (entry = sinks.dequeue()) {
-      removeNode(g, buckets, zeroIdx, entry);
-    }
-    while (entry = sources.dequeue()) {
-      removeNode(g, buckets, zeroIdx, entry);
-    }
+    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }
+    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
     if (g.nodeCount()) {
       for (let i = buckets.length - 2; i > 0; --i) {
         entry = buckets[i].dequeue();
@@ -51,22 +42,25 @@ function doGreedyFAS(g, buckets, zeroIdx) {
       }
     }
   }
+
   return results;
 }
+
 function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
   let results = collectPredecessors ? [] : undefined;
+
   g.inEdges(entry.v).forEach(edge => {
     let weight = g.edge(edge);
     let uEntry = g.node(edge.v);
+
     if (collectPredecessors) {
-      results.push({
-        v: edge.v,
-        w: edge.w
-      });
+      results.push({ v: edge.v, w: edge.w });
     }
+
     uEntry.out -= weight;
     assignBucket(buckets, zeroIdx, uEntry);
   });
+
   g.outEdges(entry.v).forEach(edge => {
     let weight = g.edge(edge);
     let w = edge.w;
@@ -74,19 +68,19 @@ function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
     wEntry["in"] -= weight;
     assignBucket(buckets, zeroIdx, wEntry);
   });
+
   g.removeNode(entry.v);
+
   return results;
 }
+
 function buildState(g, weightFn) {
-  let fasGraph = new _graphlib.Graph();
+  let fasGraph = new Graph();
   let maxIn = 0;
   let maxOut = 0;
+
   g.nodes().forEach(v => {
-    fasGraph.setNode(v, {
-      v: v,
-      "in": 0,
-      out: 0
-    });
+    fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
   });
 
   // Aggregate weights on nodes, but also sum the weights across multi-edges
@@ -97,19 +91,19 @@ function buildState(g, weightFn) {
     let edgeWeight = prevWeight + weight;
     fasGraph.setEdge(e.v, e.w, edgeWeight);
     maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
-    maxIn = Math.max(maxIn, fasGraph.node(e.w)["in"] += weight);
+    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)["in"]  += weight);
   });
-  let buckets = range(maxOut + maxIn + 3).map(() => new _list.default());
+
+  let buckets = range(maxOut + maxIn + 3).map(() => new List());
   let zeroIdx = maxIn + 1;
+
   fasGraph.nodes().forEach(v => {
     assignBucket(buckets, zeroIdx, fasGraph.node(v));
   });
-  return {
-    graph: fasGraph,
-    buckets: buckets,
-    zeroIdx: zeroIdx
-  };
+
+  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
 }
+
 function assignBucket(buckets, zeroIdx, entry) {
   if (!entry.out) {
     buckets[0].enqueue(entry);
@@ -119,11 +113,12 @@ function assignBucket(buckets, zeroIdx, entry) {
     buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
   }
 }
+
 function range(limit) {
   const range = [];
   for (let i = 0; i < limit; i++) {
     range.push(i);
   }
+
   return range;
 }
-module.exports = exports.default;