unit2_pp/scripts/unit2_exercise.py
def dijkstra(start_index, goal_index, width, height, costmap, resolution, origin, grid_viz = None):
  ''' 
  Performs Dijkstra's shortes path algorithm search on a costmap with a given start and goal node
  '''
  #### To-do: complete all exercises below ####


  pass
 
  Performs Dijkstra's shortes path algorithm search on a costmap with a given start and goal node
  
Performs Dijkstra's shortes path algorithm search on a costmap with a given start and goal node
Performs Dijkstra ' s shortes path algorithm search on a costmap with a given start and goal node
def dijkstra(start_index, goal_index, width, height, costmap, resolution, origin, grid_viz = None):
  pass
def dijkstra ( start_index , goal_index , width , height , costmap , resolution , origin , grid_viz = None ) : pass
Performs Dijkstra's shortes path algorithm search on a costmap with a given start and goal node
Performs Dijkstra ' s shortes path algorithm search on a costmap with a given start and goal node
''' 
  Performs Dijkstra's shortes path algorithm search on a costmap with a given start and goal node
  ''' #### To-do: complete all exercises below ####
start_index
goal_index
width
height
costmap
resolution
origin
grid_viz