DT Q45
- Option : B
- Explanation : I n Bellman Ford shortest path algorithm, we choose a node first and then we find any negative weighted cycle is reachable from source.
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.