feat: reformat

snyk · Apr 28, 2021 · 902129a · 902129a
1 parent 1362849
commit 902129a
Show file tree

Hide file tree

Showing 41 changed files with 1,476 additions and 1,257 deletions.
diff --git a/.babelrc b/.babelrc
@@ -0,0 +1,6 @@
+{
+  "presets": [
+    ["@babel/preset-env", { "targets": { "node": "current" } }],
+    "@babel/preset-typescript"
+  ]
+}
diff --git a/.gitignore b/.gitignore
@@ -2,3 +2,4 @@
 /node_modules
 /.vscode
 .idea/
+dist/
diff --git a/.prettierrc.json b/.prettierrc.json
@@ -0,0 +1,5 @@
+{
+  "arrowParens": "always",
+  "trailingComma": "all",
+  "singleQuote": true
+}
diff --git a/lib/alg/components.js b/lib/alg/components.js
@@ -1,4 +1,4 @@
-var _ = require("../lodash");
+var _ = require('../lodash');
 
 module.exports = components;
 
@@ -15,7 +15,7 @@ function components(g) {
     _.each(g.predecessors(v), dfs);
   }
 
-  _.each(g.nodes(), function(v) {
+  _.each(g.nodes(), function (v) {
     cmpt = [];
     dfs(v);
     if (cmpt.length) {

diff --git a/lib/alg/dfs.js b/lib/alg/dfs.js
@@ -1,4 +1,4 @@
-var _ = require("../lodash");
+var _ = require('../lodash');
 
 module.exports = dfs;
 
@@ -19,12 +19,12 @@ function dfs(g, vs, order) {
 
   var acc = [];
   var visited = {};
-  _.each(vs, function(v) {
+  _.each(vs, function (v) {
     if (!g.hasNode(v)) {
-      throw new Error("Graph does not have node: " + v);
+      throw new Error('Graph does not have node: ' + v);
     }
 
-    doDfs(g, v, order === "post", visited, navigation, acc);
+    doDfs(g, v, order === 'post', visited, navigation, acc);
   });
   return acc;
 }
@@ -33,10 +33,14 @@ function doDfs(g, v, postorder, visited, navigation, acc) {
   if (!_.has(visited, v)) {
     visited[v] = true;
 
-    if (!postorder) { acc.push(v); }
-    _.each(navigation(v), function(w) {
+    if (!postorder) {
+      acc.push(v);
+    }
+    _.each(navigation(v), function (w) {
       doDfs(g, w, postorder, visited, navigation, acc);
     });
-    if (postorder) { acc.push(v); }
+    if (postorder) {
+      acc.push(v);
+    }
   }
 }
diff --git a/lib/alg/dijkstra-all.js b/lib/alg/dijkstra-all.js
@@ -1,10 +1,14 @@
-var dijkstra = require("./dijkstra");
-var _ = require("../lodash");
+var dijkstra = require('./dijkstra');
+var _ = require('../lodash');
 
 module.exports = dijkstraAll;
 
 function dijkstraAll(g, weightFunc, edgeFunc) {
-  return _.transform(g.nodes(), function(acc, v) {
-    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
-  }, {});
+  return _.transform(
+    g.nodes(),
+    function (acc, v) {
+      acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
+    },
+    {},
+  );
 }
diff --git a/lib/alg/dijkstra.js b/lib/alg/dijkstra.js
@@ -1,30 +1,41 @@
-var _ = require("../lodash");
-var PriorityQueue = require("../data/priority-queue");
+var _ = require('../lodash');
+var PriorityQueue = require('../data/priority-queue');
 
 module.exports = dijkstra;
 
 var DEFAULT_WEIGHT_FUNC = _.constant(1);
 
 function dijkstra(g, source, weightFn, edgeFn) {
-  return runDijkstra(g, String(source),
+  return runDijkstra(
+    g,
+    String(source),
     weightFn || DEFAULT_WEIGHT_FUNC,
-    edgeFn || function(v) { return g.outEdges(v); });
+    edgeFn ||
+      function (v) {
+        return g.outEdges(v);
+      },
+  );
 }
 
 function runDijkstra(g, source, weightFn, edgeFn) {
   var results = {};
   var pq = new PriorityQueue();
   var v, vEntry;
 
-  var updateNeighbors = function(edge) {
+  var updateNeighbors = function (edge) {
     var w = edge.v !== v ? edge.v : edge.w;
     var wEntry = results[w];
     var weight = weightFn(edge);
     var distance = vEntry.distance + weight;
 
     if (weight < 0) {
-      throw new Error("dijkstra does not allow negative edge weights. " +
-                      "Bad edge: " + edge + " Weight: " + weight);
+      throw new Error(
+        'dijkstra does not allow negative edge weights. ' +
+          'Bad edge: ' +
+          edge +
+          ' Weight: ' +
+          weight,
+      );
     }
 
     if (distance < wEntry.distance) {
@@ -34,7 +45,7 @@ function runDijkstra(g, source, weightFn, edgeFn) {
     }
   };
 
-  g.nodes().forEach(function(v) {
+  g.nodes().forEach(function (v) {
     var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
     results[v] = { distance: distance };
     pq.add(v, distance);

diff --git a/lib/alg/find-cycles.js b/lib/alg/find-cycles.js
@@ -1,10 +1,12 @@
-var _ = require("../lodash");
-var tarjan = require("./tarjan");
+var _ = require('../lodash');
+var tarjan = require('./tarjan');
 
 module.exports = findCycles;
 
 function findCycles(g) {
-  return _.filter(tarjan(g), function(cmpt) {
-    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));
+  return _.filter(tarjan(g), function (cmpt) {
+    return (
+      cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]))
+    );
   });
 }
diff --git a/lib/alg/floyd-warshall.js b/lib/alg/floyd-warshall.js
@@ -1,39 +1,44 @@
-var _ = require("../lodash");
+var _ = require('../lodash');
 
 module.exports = floydWarshall;
 
 var DEFAULT_WEIGHT_FUNC = _.constant(1);
 
 function floydWarshall(g, weightFn, edgeFn) {
-  return runFloydWarshall(g,
+  return runFloydWarshall(
+    g,
     weightFn || DEFAULT_WEIGHT_FUNC,
-    edgeFn || function(v) { return g.outEdges(v); });
+    edgeFn ||
+      function (v) {
+        return g.outEdges(v);
+      },
+  );
 }
 
 function runFloydWarshall(g, weightFn, edgeFn) {
   var results = {};
   var nodes = g.nodes();
 
-  nodes.forEach(function(v) {
+  nodes.forEach(function (v) {
     results[v] = {};
     results[v][v] = { distance: 0 };
-    nodes.forEach(function(w) {
+    nodes.forEach(function (w) {
       if (v !== w) {
         results[v][w] = { distance: Number.POSITIVE_INFINITY };
       }
     });
-    edgeFn(v).forEach(function(edge) {
+    edgeFn(v).forEach(function (edge) {
       var w = edge.v === v ? edge.w : edge.v;
       var d = weightFn(edge);
       results[v][w] = { distance: d, predecessor: v };
     });
   });
 
-  nodes.forEach(function(k) {
+  nodes.forEach(function (k) {
     var rowK = results[k];
-    nodes.forEach(function(i) {
+    nodes.forEach(function (i) {
       var rowI = results[i];
-      nodes.forEach(function(j) {
+      nodes.forEach(function (j) {
         var ik = rowI[k];
         var kj = rowK[j];
         var ij = rowI[j];

diff --git a/lib/alg/index.js b/lib/alg/index.js
@@ -1,13 +1,13 @@
 module.exports = {
-  components: require("./components"),
-  dijkstra: require("./dijkstra"),
-  dijkstraAll: require("./dijkstra-all"),
-  findCycles: require("./find-cycles"),
-  floydWarshall: require("./floyd-warshall"),
-  isAcyclic: require("./is-acyclic"),
-  postorder: require("./postorder"),
-  preorder: require("./preorder"),
-  prim: require("./prim"),
-  tarjan: require("./tarjan"),
-  topsort: require("./topsort")
+  components: require('./components'),
+  dijkstra: require('./dijkstra'),
+  dijkstraAll: require('./dijkstra-all'),
+  findCycles: require('./find-cycles'),
+  floydWarshall: require('./floyd-warshall'),
+  isAcyclic: require('./is-acyclic'),
+  postorder: require('./postorder'),
+  preorder: require('./preorder'),
+  prim: require('./prim'),
+  tarjan: require('./tarjan'),
+  topsort: require('./topsort'),
 };
diff --git a/lib/alg/is-acyclic.js b/lib/alg/is-acyclic.js
@@ -1,4 +1,4 @@
-var topsort = require("./topsort");
+var topsort = require('./topsort');
 
 module.exports = isAcyclic;
 

diff --git a/lib/alg/postorder.js b/lib/alg/postorder.js
@@ -1,7 +1,7 @@
-var dfs = require("./dfs");
+var dfs = require('./dfs');
 
 module.exports = postorder;
 
 function postorder(g, vs) {
-  return dfs(g, vs, "post");
+  return dfs(g, vs, 'post');
 }
diff --git a/lib/alg/preorder.js b/lib/alg/preorder.js
@@ -1,7 +1,7 @@
-var dfs = require("./dfs");
+var dfs = require('./dfs');
 
 module.exports = preorder;
 
 function preorder(g, vs) {
-  return dfs(g, vs, "pre");
+  return dfs(g, vs, 'pre');
 }
diff --git a/lib/alg/prim.js b/lib/alg/prim.js
@@ -1,6 +1,6 @@
-var _ = require("../lodash");
-var Graph = require("../graph");
-var PriorityQueue = require("../data/priority-queue");
+var _ = require('../lodash');
+var Graph = require('../graph');
+var PriorityQueue = require('../data/priority-queue');
 
 module.exports = prim;
 
@@ -26,7 +26,7 @@ function prim(g, weightFunc) {
     return result;
   }
 
-  _.each(g.nodes(), function(v) {
+  _.each(g.nodes(), function (v) {
     pq.add(v, Number.POSITIVE_INFINITY);
     result.setNode(v);
   });
@@ -40,7 +40,7 @@ function prim(g, weightFunc) {
     if (_.has(parents, v)) {
       result.setEdge(v, parents[v]);
     } else if (init) {
-      throw new Error("Input graph is not connected: " + g);
+      throw new Error('Input graph is not connected: ' + g);
     } else {
       init = true;
     }

diff --git a/lib/alg/tarjan.js b/lib/alg/tarjan.js
@@ -1,4 +1,4 @@
-var _ = require("../lodash");
+var _ = require('../lodash');
 
 module.exports = tarjan;
 
@@ -9,14 +9,14 @@ function tarjan(g) {
   var results = [];
 
   function dfs(v) {
-    var entry = visited[v] = {
+    var entry = (visited[v] = {
       onStack: true,
       lowlink: index,
-      index: index++
-    };
+      index: index++,
+    });
     stack.push(v);
 
-    g.successors(v).forEach(function(w) {
+    g.successors(v).forEach(function (w) {
       if (!_.has(visited, w)) {
         dfs(w);
         entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);
@@ -37,7 +37,7 @@ function tarjan(g) {
     }
   }
 
-  g.nodes().forEach(function(v) {
+  g.nodes().forEach(function (v) {
     if (!_.has(visited, v)) {
       dfs(v);
     }

diff --git a/lib/alg/topsort.js b/lib/alg/topsort.js
@@ -1,4 +1,4 @@
-var _ = require("../lodash");
+var _ = require('../lodash');
 
 module.exports = topsort;
 topsort.CycleException = CycleException;
@@ -32,4 +32,4 @@ function topsort(g) {
 }
 
 function CycleException() {}
-CycleException.prototype = new Error(); // must be an instance of Error to pass testing
+CycleException.prototype = new Error(); // must be an instance of Error to pass testing
-Original file line number
+Diff line change
@@ Expand Up / @@ -2,3 +2,4 @@ @@
     /node_modules
     /.vscode
     .idea/
+    dist/