More style fixes

Author: felipernb

.jshintrc

@@ -11,6 +11,7 @@
   "unused": true,
   "strict": true,
   "maxlen": 80,
+  "white": true,
   "trailing": true,
   "curly": false,
   "globals": {

algorithms/graph/euler_path.js

@@ -32,29 +32,29 @@ var Graph = require('../../data_structures/graph');
  * @param {Graph} Graph, must be connected and contain at least one vertex.
  * @return Object
  */
-var eulerEndpoints = function(graph) {
+var eulerEndpoints = function (graph) {
   var rank = {};
   //     start     ->  rank = +1
   // middle points ->  rank =  0
   //    finish     ->  rank = -1
 
   // Initialize ranks to be outdegrees of vertices.
-  graph.vertices.forEach(function(vertex) {
+  graph.vertices.forEach(function (vertex) {
     rank[vertex] = graph.neighbors(vertex).length;
   });
 
   if (graph.directed) {
     // rank = outdegree - indegree
-    graph.vertices.forEach(function(vertex) {
-      graph.neighbors(vertex).forEach(function(neighbor) {
+    graph.vertices.forEach(function (vertex) {
+      graph.neighbors(vertex).forEach(function (neighbor) {
         rank[neighbor] -= 1;
       });
     });
   }
   else {
     // Compute ranks from vertex degree parity values.
     var startChosen = false;
-    graph.vertices.forEach(function(vertex) {
+    graph.vertices.forEach(function (vertex) {
       rank[vertex] %= 2;
       if (rank[vertex]) {
         if (startChosen) {
@@ -67,7 +67,7 @@ var eulerEndpoints = function(graph) {
 
   var start, finish;
 
-  graph.vertices.forEach(function(vertex) {
+  graph.vertices.forEach(function (vertex) {
     if (rank[vertex] == 1) {
       if (start !== undefined) {
         throw new Error('Duplicate start vertex.');
@@ -104,7 +104,7 @@ var eulerEndpoints = function(graph) {
  * @param {Graph}
  * @return Array
  */
-var eulerPath = function(graph) {
+var eulerPath = function (graph) {
   if (!graph.vertices.length) {
     return [];
   }
@@ -116,7 +116,7 @@ var eulerPath = function(graph) {
   graph.vertices.forEach(seen.addVertex.bind(seen));
 
   (function dfs(vertex) {
-    graph.neighbors(vertex).forEach(function(neighbor) {
+    graph.neighbors(vertex).forEach(function (neighbor) {
       if (!seen.edge(vertex, neighbor)) {
         seen.addEdge(vertex, neighbor);
         dfs(neighbor);
@@ -125,7 +125,7 @@ var eulerPath = function(graph) {
     });
   }(endpoints.start));
 
-  graph.vertices.forEach(function(vertex) {
+  graph.vertices.forEach(function (vertex) {
     if (seen.neighbors(vertex).length < graph.neighbors(vertex).length) {
       throw new Error('There is no euler path for a disconnected graph.');
     }

data_structures/bst.js

@@ -67,9 +67,9 @@ BST.prototype.insert = function (value, parent) {
   }
 
   var child = this._comparator.lessThan(value, parent.value) ? 'left' : 'right';
-  if (parent[child])
+  if (parent[child]) {
     this.insert(value, parent[child]);
-  else {
+  } else {
     parent[child] = new Node(value, parent);
     this._size++;
   }

package.json

@@ -11,6 +11,7 @@
     "coveralls": "^2.10.0",
     "istanbul": "^0.2.10",
     "jshint": "~2.4.4",
+    "jscs": "1.4.5",
     "mocha": "^1.20.0"
   },
   "repository": {

test/algorithms/graph/euler_path.js

@@ -27,35 +27,35 @@ var eulerPath = require('../../../algorithms/graph/euler_path'),
     assert = require('assert');
 
 
-var verifyEulerPath = function(graph, trail) {
+var verifyEulerPath = function (graph, trail) {
   var visited = new Graph(graph.directed);
   graph.vertices.forEach(visited.addVertex.bind(visited));
 
-  trail.slice(1).reduce(function(previous, current) {
+  trail.slice(1).reduce(function (previous, current) {
     assert(graph.edge(previous, current));
     assert(!visited.edge(previous, current));
     visited.addEdge(previous, current);
     return current;
   }, trail[0]);
 
-  graph.vertices.forEach(function(vertex) {
+  graph.vertices.forEach(function (vertex) {
     assert.equal(graph.neighbors(vertex).length,
                  visited.neighbors(vertex).length);
   });
 };
 
 
-var graphFromEdges = function(directed, edges) {
+var graphFromEdges = function (directed, edges) {
   var graph = new Graph(directed);
-  edges.forEach(function(edge) {
+  edges.forEach(function (edge) {
     graph.addEdge(edge[0], edge[1]);
   });
   return graph;
 };
 
 
-describe('Euler Path', function() {
-  it('should compute Euler tour over the undirected graph', function() {
+describe('Euler Path', function () {
+  it('should compute Euler tour over the undirected graph', function () {
     var graph = graphFromEdges(false, [[1, 2],
                                        [1, 5],
                                        [1, 7],
@@ -76,7 +76,7 @@ describe('Euler Path', function() {
     assert.equal(trail[0], trail.slice(-1)[0]);
   });
 
-  it('should compute Euler walk over the undirected graph', function() {
+  it('should compute Euler walk over the undirected graph', function () {
     var graph = graphFromEdges(false, [[1, 2],
                                        [1, 5],
                                        [1, 7],
@@ -99,7 +99,7 @@ describe('Euler Path', function() {
     assert.equal(endpoints[1], 8);
   });
 
-  it('should compute Euler tour over the directed graph', function() {
+  it('should compute Euler tour over the directed graph', function () {
     var graph = graphFromEdges(true, [[0, 1],
                                       [1, 2],
                                       [2, 0],
@@ -115,7 +115,7 @@ describe('Euler Path', function() {
     assert.equal(trail[0], trail.slice(-1)[0]);
   });
 
-  it('should compute Euler walk over the directed graph', function() {
+  it('should compute Euler walk over the directed graph', function () {
     var graph = graphFromEdges(true, [[5, 0],
                                       [0, 2],
                                       [2, 4],
@@ -127,20 +127,20 @@ describe('Euler Path', function() {
     assert.deepEqual(trail, [5, 3, 1, 5, 0, 2, 4, 0]);
   });
 
-  it('should return single-vertex-trail for an isolated vertex', function() {
+  it('should return single-vertex-trail for an isolated vertex', function () {
     var graph = new Graph();
     graph.addVertex('loner');
     var trail = eulerPath(graph);
     assert.deepEqual(trail, ['loner']);
   });
 
-  it('should return empty trail for an empty graph', function() {
+  it('should return empty trail for an empty graph', function () {
     var graph = new Graph();
     var trail = eulerPath(graph);
     assert.deepEqual(trail, []);
   });
 
-  it('should raise an error if there is no Euler path', function() {
+  it('should raise an error if there is no Euler path', function () {
     var graph = graphFromEdges(false, [[0, 1], [2, 3]]);
     assert.throws(eulerPath.bind(graph));
     graph = graphFromEdges(false, [[0, 1],