lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

represent record of searched verices as a hash for O(1) lookup

Browse Source
This commit is contained in:
TimoSci
2019-12-08 12:56:36 +01:00
parent b65c3de283
commit 70ddf46cb3
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
06_breadth-first_search/ruby/01_breadth-first_search.rb
View File

@@ -18,16 +18,16 @@ def search(name)
search_queue = [] search_queue = []
search_queue += @graph[name] search_queue += @graph[name]
# This array is how you keep track of which people you've searched before. # This array is how you keep track of which people you've searched before.
searched = [] searched = {}
until search_queue.empty? until search_queue.empty?
person = search_queue.shift person = search_queue.shift
# Only search this person if you haven't already searched them. # Only search this person if you haven't already searched them.
next if searched.member?(person) next if searched[person]
return person if yield person return person if yield person
search_queue += @graph[person] search_queue += @graph[person]
# Marks this person as searched # Marks this person as searched
searched.push(person) searched[person] = true
end end
false false