Get App

Python: Which practice avoids a common mistake with Graphs and Adjacency Lists?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which practice avoids a common mistake with Graphs and Adjacency Lists?

  1. Ignore the Graphs and Adjacency Lists issue and rely on team discipline instead of clearer APIs or invariants.
  2. Do not forget whether the graph is directed, undirected, weighted, or cyclic, because the representation and traversal rules depend on that contract.
  3. Silence the Graphs and Adjacency Lists problem by using broad catches, hidden globals, or extra shared mutable state.
  4. Prefer the version of Graphs and Adjacency Lists that makes behavior less predictable as long as the code still runs.

Hint

Look for the option that protects correctness instead of hiding the problem.

Answer and rationale

Correct answer: B. Do not forget whether the graph is directed, undirected, weighted, or cyclic, because the representation and traversal rules depend on that contract.

Do not forget whether the graph is directed, undirected, weighted, or cyclic, because the representation and traversal rules depend on that contract. This is a common failure mode in real Python code and a frequent interview follow-up.

Track: Python