mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* 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>
40 lines
695 B
JavaScript
40 lines
695 B
JavaScript
import { breadthFirstSearch } from '../BreadthFirstSearch'
|
|
|
|
describe('BreadthFirstSearch', () => {
|
|
const graph = {
|
|
A: ['B', 'D'],
|
|
B: ['E'],
|
|
C: ['D'],
|
|
D: ['A'],
|
|
E: ['D'],
|
|
F: ['G'],
|
|
G: []
|
|
}
|
|
/*
|
|
A <-> B
|
|
ʌ |
|
|
| |
|
|
v v
|
|
C --> D <-- E
|
|
|
|
F --> G
|
|
*/
|
|
|
|
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, 'F'))).toEqual(['F', 'G'])
|
|
})
|
|
})
|