Commitd0a1358

committed

Add basic tests for bellman ford

1 parent28b5d0f commitd0a1358Copy full SHA for d0a1358

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+varexported=`
	`2`	`+require('../../../src/graphs/shortest-path/bellman-ford'),`
	`3`	`+bellmanFord=exported.bellmanFord,`
	`4`	`+Vertex=exported.Vertex,`
	`5`	`+Edge=exported.Edge;`
	`6`	`+`
	`7`	`+describe('Bellman-Ford',function(){`
	`8`	`+'use strict';`
	`9`	`+it('should exports a method called bellmanFord',function(){`
	`10`	`+expect(typeofbellmanFord).toBe('function');`
	`11`	`+});`
	`12`	`+`
	`13`	`+it('should work for an empty graph',function(){`
	`14`	`+varvs=[];`
	`15`	`+vare=[];`
	`16`	`+expect(bellmanFord(vs,e,undefined))`
	`17`	`+.toEqual({parents:{},distances:{undefined:0}});`
	`18`	`+});`
	`19`	`+`
	`20`	`+it('should work for a graph with a single vertex',function(){`
	`21`	`+varvs=[newVertex(1)];`
	`22`	`+vare=[];`
	`23`	`+expect(bellmanFord(vs,e,1))`
	`24`	`+.toEqual({parents:{'1':null},distances:{'1':0}});`
	`25`	`+});`
	`26`	`+`
	`27`	`+it('should work in the general case',function(){`
	`28`	`+varvs=[newVertex(1),newVertex(2),newVertex(3)];`
	`29`	`+vare=[];`
	`30`	`+expect(bellmanFord(vs,e,1))`
	`31`	`+.toEqual({parents:{'1':null},distances:{'1':0}});`
	`32`	`+});`
	`33`	`+});`

Comments

(0)