Why does compute_bfs_path() choose the slow road without hesitation?
- A.It has a bug
- B.It counts steps, and the slow road is one step like any other — the graph has no way to say an edge is long
- C.It prefers rows to columns
- D.It always chooses the first neighbor in the list
Answer Why?
A normal block takes 4 seconds and the slow segment takes 16. What is its weight?
- A.16
- B.4 — it costs four normal blocks' worth of time
- C.12
- D.0.25
Answer Why?
With the slow segment at weight 5, which route does BFS choose from (0,0) to (0,3), and what does it cost?
- A.Route B, cost 5 — BFS finds the cheapest path
- B.Route A, cost 7 — BFS finds the fewest steps, and A has 3 steps to B's 5
- C.Route A, cost 3
- D.Neither; it reports no path
Answer Why?
The slow segment measures weight 3. From (0,0) to (0,3), what happens?
- A.The detour is faster by 2
- B.The straight route costs 1+3+1 = 5 and the detour costs 5 — a tie, so the slow road is not slow enough to change the answer
- C.The straight route is faster by 2
- D.BFS reports no path
Answer Why?