Update bfs according to jshintrc

mgechev · mgechev · commit babff99b9c4f · 2014-03-14T09:54:48.000+02:00
diff --git a/src/graphs/searching/bfs.js b/src/graphs/searching/bfs.js
@@ -10,59 +10,69 @@ var graph = [[1,0,1,0,0,0],
              [0,0,0,0,1,1]];
 * * * * * * * * * * * * * * * * * */
 
+'use strict';
+
 /**
  * Breadth-first search algorithm for matrix representation of graph.
  * The algorithm finds whether there's a path between two given nodes.
  */
-var breadthFirstSearch = function () {
+var breadthFirstSearch = (function () {
+
+  var visited = [],
+      queue = [],
+      target,
+      graph;
 
-    var visted = [],
-        queue = [],
-        target,
-        graph;
+  /**
+   * Initializes the algorithm
+   *
+   * @private
+   * @param {array} inputGraph The input matrix of the graph
+   * @param {number} destination The destination
+   */
+  function init(inputGraph, destination) {
+    graph = inputGraph;
+    target = destination;
+    visited = [];
+    queue = [];
+    for (var i = 0; i < graph.length; i += 1) {
+      visited[i] = false;
+    }
+  }
 
-    /**
-     * Initializes the algorithm
-     *
-     * @private
-     * @param {array} inputGraph The input matrix of the graph
-     * @param {number} destination The destination
-     */
-    function init(inputGraph, destination) {
-        graph = inputGraph;
-        target = destination;
-        visited = [];
-        queue = [];
-        for (var i = 0; i < graph.length; i += 1)
-            visited[i] = false;
+  function processNode(destination, current, node) {
+    if (graph[current][node]) {
+      if (node === destination) {
+        return true;
+      }
+      if (!visited[node]) {
+        queue.push(node);
+      }
     }
+  }
 
-    /**
-     * Finds whether there's a path between a given start node
-     * to given destination
-     *
-     * @public
-     * @param {array} graph A matrix representation of the graph
-     * @param {number} source The source node
-     * @param {number} destination The destination node
-     * @returns {boolean} true/false depending whether there's a path between the nodes
-     */
-    return function (graph, source, destination) {
-        init(graph, destination);
-        var current;
-        queue.push(source);
-        while (queue.length > 0) {
-            current = queue.shift();
-            visited[current] = true;
-            for (var i = 0; i < graph.length; i += 1) {
-                if (graph[current][i]) {
-                    if (i === destination)
-                        return true;
-                    if (!visited[i])
-                        queue.push(i);
-                } 
-            }
-        }
-        return false;
-    };
-}();
+  /**
+   * Finds whether there's a path between a given start node
+   * to given destination
+   *
+   * @public
+   * @param {array} graph A matrix representation of the graph
+   * @param {number} source The source node
+   * @param {number} destination The destination node
+   * @returns {boolean} true/false depending whether there's
+   *                               a path between the nodes
+   */
+  return function (graph, source, destination) {
+    init(graph, destination);
+    var current;
+    queue.push(source);
+    while (queue.length > 0) {
+      current = queue.shift();
+      visited[current] = true;
+      for (var i = 0; i < graph.length; i += 1) {
+        processNode(destination, current, i);
+      }
+    }
+    return false;
+  };
+}());
