chore: fix spelling

./Graphs/DepthFirstSearchRecursive.js:26: recursivly ==> recursively
This commit is contained in:
Rak Laptudirm
2021-10-28 13:52:22 +05:30
committed by GitHub
parent d16336a000
commit b30f9f36f5

View File

@ -23,7 +23,7 @@ class GraphUnweightedUndirected {
if (node === value) { return true }
// adding the current node to the visited set
visited.add(node)
// calling the helper function recursivly for all unvisited nodes
// calling the helper function recursively for all unvisited nodes
for (const neighbour of this.connections[node]) {
if (!visited.has(neighbour)) {
if (this.DFSRecursive(neighbour, value, visited)) { return true }