hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-26 23:21:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix tests.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-08-17 10:31:18 +03:00
parent 980601295d
commit 983492115d
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/algorithms/graph/prim/__test__/prim.test.js
View File

@ -55,7 +55,7 @@ describe('prim', () => {
expect(minimumSpanningTree.getWeight()).toBe(24); expect(minimumSpanningTree.getWeight()).toBe(24);
expect(minimumSpanningTree.getAllVertices().length).toBe(graph.getAllVertices().length); expect(minimumSpanningTree.getAllVertices().length).toBe(graph.getAllVertices().length);
expect(minimumSpanningTree.getAllEdges().length).toBe(graph.getAllVertices().length - 1); expect(minimumSpanningTree.getAllEdges().length).toBe(graph.getAllVertices().length - 1);
expect(minimumSpanningTree.toString()).toBe('A,B,D,C,E,F,G'); expect(minimumSpanningTree.toString()).toBe('A,B,C,E,D,F,G');
}); });
it('should find minimum spanning tree for simple graph', () => { it('should find minimum spanning tree for simple graph', () => {

4
src/data-structures/heap/Heap.js
View File

@ -257,9 +257,9 @@ export default class Heap {
nextIndex = this.getLeftChildIndex(currentIndex); nextIndex = this.getLeftChildIndex(currentIndex);
} }
if (!this.pairIsInCorrectOrder( if (this.pairIsInCorrectOrder(
this.heapContainer[nextIndex],
this.heapContainer[currentIndex], this.heapContainer[currentIndex],
this.heapContainer[nextIndex],
)) { )) {
break; break;
} }