Quiz: Algorithm Selection

You have a graph with $10{,}000$ nodes, $50{,}000$ edges, and all edge weights are non-negative. Which approach is fastest for single-source shortest paths?

1. A.Bellman-Ford, because it handles all edge types
2. B.SPFA, because it is always faster than Bellman-Ford
3. C.Dijkstra with a min-heap, because all weights are non-negative
4. D.Floyd-Warshall, because the graph is dense enough