Commit 9834921

committed

Fix tests.

1 parent 9806012 commit 9834921Copy full SHA for 9834921

File tree

-3

lines changed

src
- algorithms/graph/prim/__test__
  - prim.test.js
- data-structures/heap
  - Heap.js

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -55,7 +55,7 @@ describe('prim', () => {`
`55`	`55`	`expect(minimumSpanningTree.getWeight()).toBe(24);`
`56`	`56`	`expect(minimumSpanningTree.getAllVertices().length).toBe(graph.getAllVertices().length);`
`57`	`57`	`expect(minimumSpanningTree.getAllEdges().length).toBe(graph.getAllVertices().length - 1);`
`58`		`- expect(minimumSpanningTree.toString()).toBe('A,B,D,C,E,F,G');`
	`58`	`+ expect(minimumSpanningTree.toString()).toBe('A,B,C,E,D,F,G');`
`59`	`59`	`});`
`60`	`60`
`61`	`61`	`it('should find minimum spanning tree for simple graph', () => {`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -257,9 +257,9 @@ export default class Heap {`
`257`	`257`	`nextIndex = this.getLeftChildIndex(currentIndex);`
`258`	`258`	`}`
`259`	`259`
`260`		`- if (!this.pairIsInCorrectOrder(`
`261`		`- this.heapContainer[nextIndex],`
	`260`	`+ if (this.pairIsInCorrectOrder(`
`262`	`261`	`this.heapContainer[currentIndex],`
	`262`	`+ this.heapContainer[nextIndex],`
`263`	`263`	`)) {`
`264`	`264`	`break;`
`265`	`265`	`}`

Comments

(0)