Add basic tests for dijkstra

mgechev · mgechev · commit 60f2983ebc42 · 2015-04-26T17:53:32.000+02:00
diff --git a/src/graphs/shortest-path/dijkstra.js b/src/graphs/shortest-path/dijkstra.js
@@ -113,7 +113,7 @@
         current = unvisited.extract();
       }
       if (distance[dest]) {
-        return distance[dest].distance || Infinity;
+        return distance[dest].distance;
       }
       return Infinity;
     };
diff --git a/test/graphs/shortest-path/dijkstra.spec.js b/test/graphs/shortest-path/dijkstra.spec.js
@@ -12,4 +12,15 @@ describe('dijkstra', function () {
     expect(dijkstra(0, 0, [])).toBe(Infinity);
   });
 
+  it('should work when the src and dest are the same', function () {
+    expect(dijkstra(0, 0, [[0]])).toBe(0);
+  });
+
+  it('should work when there\'s no path', function () {
+    expect(dijkstra(0, 1, [[0, Infinity], [Infinity, 0]])).toBe(Infinity);
+  });
+
+  it('should find the shortest path', function () {
+    expect(dijkstra(0, 2, [[0, 1, 4], [1, 0, 1], [4, 1, 0]])).toBe(2);
+  });
 });

Original file line number	Diff line number	Diff line change
`@@ -113,7 +113,7 @@`
`113`	`113`	`current = unvisited.extract();`
`114`	`114`	`}`
`115`	`115`	`if (distance[dest]) {`
`116`		`- return distance[dest].distance \|\| Infinity;`
	`116`	`+ return distance[dest].distance;`
`117`	`117`	`}`
`118`	`118`	`return Infinity;`
`119`	`119`	`};`