Multiple ChoiceHard 30s
Bellman-Ford Algorithm
Bellman-Ford can handle ____, unlike Dijkstra.
Options
- 1Directed graphs only
- 2Unweighted graphs
- 3Negative edge weights
- 4Large graphs
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.