Bellman-Ford: Detect Negative Cycle
Medium
Shortest Path Algorithms
Given a directed weighted graph that may contain negative weights, print true if it contains a cycle whose total weight is negative, otherwise false.
Constraints
1 <= n <= 1000 0 <= m <= 5000 -10^4 <= w <= 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.