samples/13_path_finding_algorithms/05_dijkstra/app/main.rb
# Adds a hill in the second grid in the cell the mouse is over
Adds a hill in the second grid in the cell the mouse is over
Adds a hill in the second grid in the cell the mouse is over
def input_add_hill2
    if mouse_over_grid2?
      unless state.hills.has_key?(cell_closest_to_mouse2)
        state.hills[cell_closest_to_mouse2] = true
        reset_search
      end
    end
  end
def input_add_hill2 if mouse_over_grid2? unless state . hills . has_key? ( cell_closest_to_mouse2 ) state . hills [ cell_closest_to_mouse2 ] = true reset_search end end end
Adds a hill in the second grid in the cell the mouse is over
Adds a hill in the second grid in the cell the mouse is over