Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit b30f9f3

Browse files
chore: fix spelling
./Graphs/DepthFirstSearchRecursive.js:26: recursivly ==> recursively
1 parent d16336a commit b30f9f3

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎Graphs/DepthFirstSearchRecursive.js‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ class GraphUnweightedUndirected {
2323
if (node === value) { return true }
2424
// adding the current node to the visited set
2525
visited.add(node)
26-
// calling the helper function recursivly for all unvisited nodes
26+
// calling the helper function recursively for all unvisited nodes
2727
for (const neighbour of this.connections[node]) {
2828
if (!visited.has(neighbour)) {
2929
if (this.DFSRecursive(neighbour, value, visited)) { return true }

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /