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