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

10
Graphs/DijkstraSmallestPath.js
View File

@ -1,5 +1,5 @@
// starting at s
function solve (graph, s) {
function solve(graph, s) {
const solutions = {}
solutions[s] = []
solutions[s].dist = 0
@ -10,12 +10,16 @@ function solve (graph, s) {
let dist = Infinity
for (const n in solutions) {
if (!solutions[n]) { continue }
if (!solutions[n]) {
continue
}
const ndist = solutions[n].dist
const adj = graph[n]
for (const a in adj) {
if (solutions[a]) { continue }
if (solutions[a]) {
continue
}
const d = adj[a] + ndist
if (d < dist) {