silisium_bfs_simplifier.rb

def breadth_first_search?(start, goal)
  visited = Hash.new(false)
  queue = Queue.new << start
  visited[start] = true
  until queue.empty?
    node = queue.pop
    return true if node == goal
    @vertices[node].each { |child| bfs_add_node(queue, visited, child) }
  end
  false
end

def bfs_add_node(queue, visited, node)
  return if visited[node]
  queue.push(node)
  visited[node] = true
end