algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2026-03-13 15:21:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* chore: Switch to Node 20 + Vitest

* chore: migrate to vitest mock functions

* chore: code style (switch to prettier)

* test: re-enable long-running test

Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!

see #1193

* chore: code style

* chore: fix failing tests

* Updated Documentation in README.md

* Update contribution guidelines to state usage of Prettier

* fix: set prettier printWidth back to 80

* chore: apply updated code style automatically

* fix: set prettier line endings to lf again

* chore: apply updated code style automatically

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
This commit is contained in:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
Graphs/test/BellmanFord.test.js
View File

@@ -4,10 +4,16 @@ test('Test Case 1', () => {
const V = 5
const E = 8
const destination = 3
const graph = [[0, 1, -1], [0, 2, 4],
[1, 2, 3], [1, 3, 2],
[1, 4, 2], [3, 2, 5],
[3, 1, 1], [4, 3, -3]]
const graph = [
[0, 1, -1],
[0, 2, 4],
[1, 2, 3],
[1, 3, 2],
[1, 4, 2],
[3, 2, 5],
[3, 1, 1],
[4, 3, -3]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(-2)
})
@@ -15,10 +21,17 @@ test('Test Case 2', () => {
const V = 6
const E = 9
const destination = 4
const graph = [[0, 1, 3], [0, 3, 6],
[0, 5, -1], [1, 2, -3],
[1, 4, -2], [5, 2, 5],
[2, 3, 1], [4, 3, 5], [5, 4, 2]]
const graph = [
[0, 1, 3],
[0, 3, 6],
[0, 5, -1],
[1, 2, -3],
[1, 4, -2],
[5, 2, 5],
[2, 3, 1],
[4, 3, 5],
[5, 4, 2]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(1)
})
@@ -26,9 +39,13 @@ test('Test Case 3', () => {
const V = 4
const E = 5
const destination = 1
const graph = [[0, 3, -1], [0, 2, 4],
[3, 2, 2], [3, 1, 5],
[2, 1, -1]]
const graph = [
[0, 3, -1],
[0, 2, 4],
[3, 2, 2],
[3, 1, 5],
[2, 1, -1]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(0)
})

15
Graphs/test/BreadthFirstSearch.test.js
View File

@@ -21,8 +21,19 @@ describe('BreadthFirstSearch', () => {
*/
it('should return the visited nodes', () => {
expect(Array.from(breadthFirstSearch(graph, 'C'))).toEqual(['C', 'D', 'A', 'B', 'E'])
expect(Array.from(breadthFirstSearch(graph, 'A'))).toEqual(['A', 'B', 'D', 'E'])
expect(Array.from(breadthFirstSearch(graph, 'C'))).toEqual([
'C',
'D',
'A',
'B',
'E'
])
expect(Array.from(breadthFirstSearch(graph, 'A'))).toEqual([
'A',
'B',
'D',
'E'
])
expect(Array.from(breadthFirstSearch(graph, 'F'))).toEqual(['F', 'G'])
})
})

15
Graphs/test/BreadthFirstShortestPath.test.js
View File

@@ -21,8 +21,19 @@ describe('BreadthFirstShortestPath', () => {
*/
it('should return the visited nodes', () => {
expect(breadthFirstShortestPath(graph, 'C', 'E')).toEqual(['C', 'D', 'A', 'B', 'E'])
expect(breadthFirstShortestPath(graph, 'E', 'B')).toEqual(['E', 'D', 'A', 'B'])
expect(breadthFirstShortestPath(graph, 'C', 'E')).toEqual([
'C',
'D',
'A',
'B',
'E'
])
expect(breadthFirstShortestPath(graph, 'E', 'B')).toEqual([
'E',
'D',
'A',
'B'
])
expect(breadthFirstShortestPath(graph, 'F', 'G')).toEqual(['F', 'G'])
expect(breadthFirstShortestPath(graph, 'A', 'G')).toEqual([])
})