We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d16336a commit b30f9f3Copy full SHA for b30f9f3
Graphs/DepthFirstSearchRecursive.js
@@ -23,7 +23,7 @@ class GraphUnweightedUndirected {
23
if (node === value) { return true }
24
// adding the current node to the visited set
25
visited.add(node)
26
- // calling the helper function recursivly for all unvisited nodes
+ // calling the helper function recursively for all unvisited nodes
27
for (const neighbour of this.connections[node]) {
28
if (!visited.has(neighbour)) {
29
if (this.DFSRecursive(neighbour, value, visited)) { return true }
0 commit comments