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 e60db10

Browse files
remove "includes" iteration; add hash
1 parent 4c7e681 commit e60db10

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

‎searching/breadth-first-search.js

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,23 +4,23 @@ const Queue = require('../data-structures/queue.js')
44

55
let BFS = (graph, source, value) => {
66
let queue = new Queue(),
7-
searched = []
7+
searched = {}
88

99
queue.enqueue(source)
1010

1111
while (queue.size()) {
1212
let current = queue.dequeue()
1313

1414
for (let i = 0; i < graph[current].length; i++) {
15-
if (!searched.includes(graph[current][i])) {
15+
if (!searched[graph[current][i]]) {
1616
if (graph[current][i] === value) {
1717
return true
1818
} else {
1919
queue.enqueue(graph[current][i])
2020
}
2121
}
2222
}
23-
searched.push(current)
23+
searched[current]=true
2424
}
2525

2626
return false

0 commit comments

Comments
(0)

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