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

Closed Karnika06 closed 2 years ago

Karnika06 commented 3 years ago

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.

I will be solving this problem using Bellman Ford's Algorithm.
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.

I would like to work on this problem using C++ language. Please assign this issue to me.

Vanshikagarg17 commented 3 years ago

You can start working on this issue. All the best!