Skip to main content
Module 6 · Dijkstra's Algorithm (optional)

Module 6 · Dijkstra's Algorithm (Optional) — Knowledge Checks

Name Date
  1. On a grid where every segment takes the same time, how do BFS and Dijkstra's algorithm compare?

    1. A.Dijkstra finds a shorter path
    2. B.They find paths of the same length — Dijkstra only differs when segments have different costs
    3. C.BFS finds a shorter path
    4. D.Dijkstra cannot run on a grid

    Answer Why?