Quiz: Why Negative Edges Break Dijkstra

Consider $3$ vertices: $A \to B$ with weight $1$, $A \to C$ with weight $3$, and $C \to B$ with weight $-5$. Dijkstra starts at $A$ and extracts $B$ first with distance $1$. What is the actual shortest distance to $B$?

1. A.$1$
2. B.$3$
3. C.$0$
4. D.$-2$