algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-07 02:05:08 +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

74
Graphs/BreadthFirstSearch.js
View File

@ -1,37 +1,37 @@
import Queue from '../Data-Structures/Queue/Queue'
/**
* Breadth-first search is an algorithm for traversing a graph.
*
* It discovers all nodes reachable from the starting position by exploring all of the neighbor nodes at the present
* depth prior to moving on to the nodes at the next depth level.
*
* (description adapted from https://en.wikipedia.org/wiki/Breadth-first_search)
* @see https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core
*/
export function breadthFirstSearch (graph, startingNode) {
// visited keeps track of all nodes visited
const visited = new Set()
// queue contains the nodes to be explored in the future
const queue = new Queue()
queue.enqueue(startingNode)
while (!queue.isEmpty()) {
// start with the queue's first node
const node = queue.dequeue()
if (!visited.has(node)) {
// mark the node as visited
visited.add(node)
const neighbors = graph[node]
// put all its neighbors into the queue
for (let i = 0; i < neighbors.length; i++) {
queue.enqueue(neighbors[i])
}
}
}
return visited
}
import Queue from '../Data-Structures/Queue/Queue'
/**
* Breadth-first search is an algorithm for traversing a graph.
*
* It discovers all nodes reachable from the starting position by exploring all of the neighbor nodes at the present
* depth prior to moving on to the nodes at the next depth level.
*
* (description adapted from https://en.wikipedia.org/wiki/Breadth-first_search)
* @see https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core
*/
export function breadthFirstSearch(graph, startingNode) {
// visited keeps track of all nodes visited
const visited = new Set()
// queue contains the nodes to be explored in the future
const queue = new Queue()
queue.enqueue(startingNode)
while (!queue.isEmpty()) {
// start with the queue's first node
const node = queue.dequeue()
if (!visited.has(node)) {
// mark the node as visited
visited.add(node)
const neighbors = graph[node]
// put all its neighbors into the queue
for (let i = 0; i < neighbors.length; i++) {
queue.enqueue(neighbors[i])
}
}
}
return visited
}