Daily-Coding-DS-ALGO-Practice icon indicating copy to clipboard operation
Daily-Coding-DS-ALGO-Practice copied to clipboard

Published 20 hours ago • verified publisher icon Ayush7614

Detect negative weight cycle

Open Karnika06 opened this issue 3 years ago • 1 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

  • 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.

Programming language

  • [ ] C
  • [x] C++
  • [ ] Java
  • [ ] Python

I would like to work on this problem using C++ language. Please assign this issue to me under LGM-SoC'21.

Karnika06 avatar Jun 29 '21 14:06 Karnika06

Im preparing for my coding interviews and it would really help me if you assign this question to me Kindly assign me this I have immense intrest in coding

KarthikTadala avatar Jun 29 '21 19:06 KarthikTadala