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

26
Graphs/ConnectedComponents.js
View File

@@ -1,23 +1,27 @@
class GraphUnweightedUndirectedAdjacencyList {
// Unweighted 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] = new Set()
}
addEdge (node1, node2) {
addEdge(node1, node2) {
// 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].add(node2)
this.connections[node2].add(node1)
}
DFSComponent (components, node, visited) {
DFSComponent(components, node, visited) {
// Helper function to populate the visited set with the nodes in each component
// adding the first visited node in the component to the array
@@ -28,18 +32,22 @@ class GraphUnweightedUndirectedAdjacencyList {
const curr = stack.pop()
visited.add(curr.toString())
for (const neighbour of this.connections[curr].keys()) {
if (!visited.has(neighbour.toString())) { stack.push(neighbour) }
if (!visited.has(neighbour.toString())) {
stack.push(neighbour)
}
}
}
}
connectedComponents () {
connectedComponents() {
// Function to generate the Connected Components
// Result is an array containing 1 node from each component
const visited = new Set()
const components = []
for (const node of Object.keys(this.connections)) {
if (!visited.has(node.toString())) { this.DFSComponent(components, node, visited) }
if (!visited.has(node.toString())) {
this.DFSComponent(components, node, visited)
}
}
return components
}