@@ -35,10 +35,10 @@
      * var shortestPath = bfs(graph, 1, 5); // [1, 2, 3, 5]
      */
     return function (graph, startNode, targetNode) {
-      var parents = [],
-          queue = [],
-          visited = [],
-          current;
+      var parents = [];
+      var queue = [];
+      var visited = [];
+      var current;
       queue.push(startNode);
       parents[startNode] = null;
       visited[startNode] = true;
 
@@ -26,7 +26,7 @@
  * edges.push(new Edge(new Vertex(8), new Vertex(7), 7));
  * graph = new Graph(edges, edges.length);
  *
- * // { edges: 
+ * // { edges:
  * //    [ { e: '1', v: 0, distance: 4 },
  * //      { e: '2', v: 8, distance: 2 },
  * //      { e: '3', v: 2, distance: 7 },
@@ -121,11 +121,11 @@
     return function () {
       init.call(this);
       var inTheTree = {};
-      var tartVertex = this.edges[0].e.id;
-      var pannigTree = [];
-      var arents = {};
-      var istances = {};
-      var urrent;
+      var startVertex = this.edges[0].e.id;
+      var spannigTree = [];
+      var parents = {};
+      var distances = {};
+      var current;
       inTheTree[startVertex] = true;
       queue.add({
         node: startVertex,