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

18
Data-Structures/Graph/Graph3.js
View File

@ -1,18 +1,18 @@
class Graph {
constructor () {
constructor() {
this.adjacencyObject = {}
}
addVertex (vertex) {
addVertex(vertex) {
if (!this.adjacencyObject[vertex]) this.adjacencyObject[vertex] = []
}
addEdge (vertex1, vertex2) {
addEdge(vertex1, vertex2) {
this.adjacencyObject[vertex1].push(vertex2)
this.adjacencyObject[vertex2].push(vertex1)
}
removeEdge (vertex1, vertex2) {
removeEdge(vertex1, vertex2) {
this.adjacencyObject[vertex1] = this.adjacencyObject[vertex1].filter(
(v) => v !== vertex2
)
@ -21,7 +21,7 @@ class Graph {
)
}
removeVertex (vertex) {
removeVertex(vertex) {
while (this.adjacencyObject[vertex].length) {
const adjacentVertex = this.adjacencyObject[vertex].pop()
this.removeEdge(vertex, adjacentVertex)
@ -31,14 +31,14 @@ class Graph {
/**
* Return DFS (Depth First Search) List Using Recursive Method
*/
DFS (start) {
DFS(start) {
if (!start) return null
const result = []
const visited = {}
const adjacencyObject = this.adjacencyObject
function dfs (vertex) {
function dfs(vertex) {
if (!vertex) return null
visited[vertex] = true
result.push(vertex)
@ -56,7 +56,7 @@ class Graph {
/**
* Return DFS(Depth First Search) List Using Iteration
*/
DFSIterative (start) {
DFSIterative(start) {
if (!start) return null
const stack = [start]
@ -80,7 +80,7 @@ class Graph {
return result
}
BFS (start) {
BFS(start) {
if (!start) return null
const queue = [start]