Detect negative weight cycle (Bellman Ford's Algorithm)

DSC-Banasthali-Vidyapith / Code-Crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.

MIT License

55 stars 78 forks source link

Detect negative weight cycle (Bellman Ford's Algorithm) #132

Open Vanshikagarg17 opened 3 years ago

Vanshikagarg17 commented 3 years ago

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.

DarkSoul26 commented 3 years ago

@Vanshikagarg17 I would like to solve this problem!

shash-2468 commented 3 years ago

Can you assign me for this issue @Ananyaas