Code-Crossroad icon indicating copy to clipboard operation
Code-Crossroad copied to clipboard

Published 20 hours ago • verified publisher icon DSC-Banasthali-Vidyapith

Detect negative weight cycle (Bellman Ford's Algorithm)

Open Vanshikagarg17 opened this issue 3 years ago • 2 comments

Aim We are given a directed graph. We need to detect whether the graph has a negative cycle or not. A negative cycle is one in which the overall sum of the cycle becomes negative.

Details Bellman Ford algorithm is a algorithm which help us to find the shortest path from a starting vertex to all other vertices of a weighted graph.

Vanshikagarg17 avatar Oct 04 '21 18:10 Vanshikagarg17

@Vanshikagarg17 I would like to solve this problem!

DarkSoul26 avatar Oct 07 '21 18:10 DarkSoul26

Can you assign me for this issue @Ananyaas

shash-2468 avatar Oct 27 '21 11:10 shash-2468