algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 17:50:39 +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

31
Graphs/PrimMST.js
View File

@ -1,24 +1,28 @@
import { KeyPriorityQueue } from '../Data-Structures/Heap/KeyPriorityQueue'
class GraphWeightedUndirectedAdjacencyList {
// Weighted Undirected Graph class
constructor () {
constructor() {
this.connections = {}
}
addNode (node) {
addNode(node) {
// Function to add a node to the graph (connection represented by set)
this.connections[node] = {}
}
addEdge (node1, node2, weight) {
addEdge(node1, node2, weight) {
// Function to add an edge (adds the node too if they are not present in the graph)
if (!(node1 in this.connections)) { this.addNode(node1) }
if (!(node2 in this.connections)) { this.addNode(node2) }
if (!(node1 in this.connections)) {
this.addNode(node1)
}
if (!(node2 in this.connections)) {
this.addNode(node2)
}
this.connections[node1][node2] = weight
this.connections[node2][node1] = weight
}
PrimMST (start) {
PrimMST(start) {
// Prim's Algorithm to generate a Minimum Spanning Tree (MST) of a graph
// Details: https://en.wikipedia.org/wiki/Prim%27s_algorithm
const distance = {}
@ -26,16 +30,21 @@ class GraphWeightedUndirectedAdjacencyList {
const priorityQueue = new KeyPriorityQueue()
// Initialization
for (const node in this.connections) {
distance[node] = (node === start.toString() ? 0 : Infinity)
distance[node] = node === start.toString() ? 0 : Infinity
parent[node] = null
priorityQueue.push(node, distance[node])
}
// Updating 'distance' object
while (!priorityQueue.isEmpty()) {
const node = priorityQueue.pop()
Object.keys(this.connections[node]).forEach(neighbour => {
if (priorityQueue.contains(neighbour) && distance[node] + this.connections[node][neighbour] < distance[neighbour]) {
distance[neighbour] = distance[node] + this.connections[node][neighbour]
Object.keys(this.connections[node]).forEach((neighbour) => {
if (
priorityQueue.contains(neighbour) &&
distance[node] + this.connections[node][neighbour] <
distance[neighbour]
) {
distance[neighbour] =
distance[node] + this.connections[node][neighbour]
parent[neighbour] = node
priorityQueue.update(neighbour, distance[neighbour])
}
@ -44,7 +53,7 @@ class GraphWeightedUndirectedAdjacencyList {
// MST Generation from the 'parent' object
const graph = new GraphWeightedUndirectedAdjacencyList()
Object.keys(parent).forEach(node => {
Object.keys(parent).forEach((node) => {
if (node && parent[node]) {
graph.addEdge(node, parent[node], this.connections[node][parent[node]])
}