Detect a negative cycle in a Graph using Shortest Path Faster Algorithm
Last Updated :
10 Aug, 2021
Given a graph G consisting of nodes valued [0, N - 1], a source S, and an array Edges[][3] of type {u, v, w} that denotes that there is a directed edge between node u and v with weight w, the task is to check if there exists a negative cycle from the given source. If found to be true, then print "Yes". Otherwise, print "No".
A negative cycle is a cycle in which the sum of all its weight in that cycle is negative.
Examples:
Input: N = 4, M = 4, Edges[][] = {{0, 1, 1}, {1, 2, -1}, {2, 3, -1}, {3, 0, -1}}, S = 0
Output: Yes
Explanation:
Starting from the source node 0, the graph contains cycle as 0 -> 1 -> 2 -> 3 -> 0.
The sum of weight in the above path is 1 - 1 - 1 - 1 = -2.
Therefore, the graph contains a negative cycle.
Input: N = 4, M = 5, Edges[][] = {{0, 2, -2}, {1, 0, 4}, {1, 2, -3}, {2, 3}, {3, 1}}, W[] = {-2, 4, -3, 2, -1}, S = 1
Output: Yes
Explanation:
Starting from the source node 1, the graph contains cycle as 1 -> 2 -> 3 -> 1.
The sum of weight in the above path is -3 + 2 - 1 = -2.
Therefore, the graph contains a negative cycle.
Approach: The idea is to use the Shortest Path Faster Algorithm(SPFA) to find if a negative cycle is present and reachable from the source vertex in a graph. Follow the below steps to solve the problem:
- Initialize the arrays dis[] with large value, vis[] with false and cnt[] to store the count about how many times a vertex has been relaxed.
- Traverse the graph using the SPFA algorithm.
- Increment the count for each vertex whenever the vertex is relaxed.
The term relaxation means updating the cost of all vertices connected to a vertex v if those costs would be improved by including the path via vertex v.
- Stop the algorithm and print "Yes" as soon as some vertex got relaxed for the Nth time as there are only N vertices i.e., from 0 to N - 1.
- Otherwise, print "No".
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
bool sfpa(int V, int src, int Edges[][3],
int M)
{
// Stores the adjacency list of
// the given graph
vector<pair<int, int> > g[V];
// Create Adjacency List
for (int i = 0; i < M; i++) {
int u = Edges[i][0];
int v = Edges[i][1];
int w = Edges[i][2];
g[u].push_back({ v, w });
}
// Stores the distance of all
// reachable vertex from source
vector<int> dist(V, INT_MAX);
// Check if vertex is present
// in queue or not
vector<bool> inQueue(V, false);
// Counts the relaxation for
// each vertex
vector<int> cnt(V, 0);
// Distance from src to src is 0
dist[src] = 0;
// Create a queue
queue<int> q;
// Push source in the queue
q.push(src);
// Mark source as visited
inQueue[src] = true;
while (!q.empty()) {
// Front vertex of Queue
int u = q.front();
q.pop();
inQueue[u] = false;
// Relaxing all edges of
// vertex from the Queue
for (pair<int, int> x : g[u]) {
int v = x.first;
int cost = x.second;
// Update the dist[v] to
// minimum distance
if (dist[v] > dist[u] + cost) {
dist[v] = dist[u] + cost;
// If vertex v is in Queue
if (!inQueue[v]) {
q.push(v);
inQueue[v] = true;
cnt[v]++;
// Negative cycle
if (cnt[v] >= V)
return true;
}
}
}
}
// No cycle found
return false;
}
// Driver Code
int main()
{
// Number of vertices
int N = 4;
// Given source node src
int src = 0;
// Number of Edges
int M = 4;
// Given Edges with weight
int Edges[][3] = { { 0, 1, 1 },
{ 1, 2, -1 },
{ 2, 3, -1 },
{ 3, 0, -1 } };
// If cycle is present
if (sfpa(N, src, Edges, M) == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
// Java program for
// the above approach
import java.util.*;
class GFG{
static class pair
{
int first, second;
public pair(int first,
int second)
{
this.first = first;
this.second = second;
}
}
static boolean sfpa(int V, int src,
int Edges[][], int M)
{
// Stores the adjacency list of
// the given graph
Vector<pair> []g = new Vector[V];
for (int i = 0; i < V; i++)
{
g[i] = new Vector<pair>();
}
// Create Adjacency List
for (int i = 0; i < M; i++)
{
int u = Edges[i][0];
int v = Edges[i][1];
int w = Edges[i][2];
g[u].add(new pair(v, w));
}
// Stores the distance of all
// reachable vertex from source
int []dist = new int[V];
Arrays.fill(dist, Integer.MAX_VALUE);
// Check if vertex is present
// in queue or not
boolean []inQueue = new boolean[V];
// Counts the relaxation for
// each vertex
int []cnt = new int[V];
// Distance from src
// to src is 0
dist[src] = 0;
// Create a queue
Queue<Integer> q = new LinkedList<>();
// Push source in the queue
q.add(src);
// Mark source as visited
inQueue[src] = true;
while (!q.isEmpty())
{
// Front vertex of Queue
int u = q.peek();
q.remove();
inQueue[u] = false;
// Relaxing all edges of
// vertex from the Queue
for (pair x : g[u])
{
int v = x.first;
int cost = x.second;
// Update the dist[v] to
// minimum distance
if (dist[v] > dist[u] + cost)
{
dist[v] = dist[u] + cost;
// If vertex v is in Queue
if (!inQueue[v])
{
q.add(v);
inQueue[v] = true;
cnt[v]++;
// Negative cycle
if (cnt[v] >= V)
return true;
}
}
}
}
// No cycle found
return false;
}
// Driver Code
public static void main(String[] args)
{
// Number of vertices
int N = 4;
// Given source node src
int src = 0;
// Number of Edges
int M = 4;
// Given Edges with weight
int Edges[][] = {{0, 1, 1},
{1, 2, -1},
{2, 3, -1},
{3, 0, -1}};
// If cycle is present
if (sfpa(N, src, Edges, M) == true)
System.out.print("Yes" + "\n");
else
System.out.print("No" + "\n");
}
}
// This code is contributed by 29AjayKumar
# Python3 program for the above approach
import sys
def sfpa(V, src, Edges, M):
# Stores the adjacency list of
# the given graph
g = [[] for i in range(V)]
# Create Adjacency List
for i in range(M):
u = Edges[i][0]
v = Edges[i][1]
w = Edges[i][2]
g[u].append([v, w])
# Stores the distance of all
# reachable vertex from source
dist = [sys.maxsize for i in range(V)]
# Check if vertex is present
# in queue or not
inQueue = [False for i in range(V)]
# Counts the relaxation for
# each vertex
cnt = [0 for i in range(V)]
# Distance from src to src is 0
dist[src] = 0
# Create a queue
q = []
# Push source in the queue
q.append(src)
# Mark source as visited
inQueue[src] = True
while (len(q)):
# Front vertex of Queue
u = q[0]
q.remove(q[0])
inQueue[u] = False
# Relaxing all edges of
# vertex from the Queue
for x in g[u]:
v = x[0]
cost = x[1]
# Update the dist[v] to
# minimum distance
if (dist[v] > dist[u] + cost):
dist[v] = dist[u] + cost
# If vertex v is in Queue
if (inQueue[v] == False):
q.append(v)
inQueue[v] = True
cnt[v] += 1
# Negative cycle
if (cnt[v] >= V):
return True
# No cycle found
return False
# Driver Code
if __name__ == '__main__':
# Number of vertices
N = 4
# Given source node src
src = 0
# Number of Edges
M = 4
# Given Edges with weight
Edges = [ [ 0, 1, 1 ],
[ 1, 2, -1 ],
[ 2, 3, -1 ],
[ 3, 0, -1 ] ]
# If cycle is present
if (sfpa(N, src, Edges, M) == True):
print("Yes")
else:
print("No")
# This code is contributed by SURENDRA_GANGWAR
// C# program for
// the above approach
using System;
using System.Collections.Generic;
class GFG{
class pair
{
public int first, second;
public pair(int first,
int second)
{
this.first = first;
this.second = second;
}
}
static bool sfpa(int V, int src,
int [,]Edges, int M)
{
// Stores the adjacency list of
// the given graph
List<pair> []g = new List<pair>[V];
for (int i = 0; i < V; i++)
{
g[i] = new List<pair>();
}
// Create Adjacency List
for (int i = 0; i < M; i++)
{
int u = Edges[i, 0];
int v = Edges[i, 1];
int w = Edges[i, 2];
g[u].Add(new pair(v, w));
}
// Stores the distance of all
// reachable vertex from source
int []dist = new int[V];
for (int i = 0; i < V; i++)
dist[i] = int.MaxValue;
// Check if vertex is present
// in queue or not
bool []inQueue = new bool[V];
// Counts the relaxation for
// each vertex
int []cnt = new int[V];
// Distance from src
// to src is 0
dist[src] = 0;
// Create a queue
Queue<int> q = new Queue<int>();
// Push source in the queue
q.Enqueue(src);
// Mark source as visited
inQueue[src] = true;
while (q.Count != 0)
{
// Front vertex of Queue
int u = q.Peek();
q.Dequeue();
inQueue[u] = false;
// Relaxing all edges of
// vertex from the Queue
foreach (pair x in g[u])
{
int v = x.first;
int cost = x.second;
// Update the dist[v] to
// minimum distance
if (dist[v] > dist[u] + cost)
{
dist[v] = dist[u] + cost;
// If vertex v is in Queue
if (!inQueue[v])
{
q.Enqueue(v);
inQueue[v] = true;
cnt[v]++;
// Negative cycle
if (cnt[v] >= V)
return true;
}
}
}
}
// No cycle found
return false;
}
// Driver Code
public static void Main(String[] args)
{
// Number of vertices
int N = 4;
// Given source node src
int src = 0;
// Number of Edges
int M = 4;
// Given Edges with weight
int [,]Edges = {{0, 1, 1},
{1, 2, -1},
{2, 3, -1},
{3, 0, -1}};
// If cycle is present
if (sfpa(N, src, Edges, M) == true)
Console.Write("Yes" + "\n");
else
Console.Write("No" + "\n");
}
}
// This code is contributed by 29AjayKumar
<script>
// Javascript program for
// the above approach
class pair
{
constructor(first, second)
{
this.first = first;
this.second = second;
}
}
function sfpa(V, src, Edges, M)
{
// Stores the adjacency list of
// the given graph
var g = Array.from(Array(V), ()=>Array());
// Create Adjacency List
for(var i = 0; i < M; i++)
{
var u = Edges[i][0];
var v = Edges[i][1];
var w = Edges[i][2];
g[u].push(new pair(v, w));
}
// Stores the distance of all
// reachable vertex from source
var dist = Array(V);
for (var i = 0; i < V; i++)
dist[i] = 1000000000;
// Check if vertex is present
// in queue or not
var inQueue = Array(V).fill(false);
// Counts the relaxation for
// each vertex
var cnt = Array(V).fill(0);
// Distance from src
// to src is 0
dist[src] = 0;
// Create a queue
var q = [];
// Push source in the queue
q.push(src);
// Mark source as visited
inQueue[src] = true;
while (q.length != 0)
{
// Front vertex of Queue
var u = q[0];
q.shift();
inQueue[u] = false;
// Relaxing all edges of
// vertex from the Queue
for(var x of g[u])
{
var v = x.first;
var cost = x.second;
// Update the dist[v] to
// minimum distance
if (dist[v] > dist[u] + cost)
{
dist[v] = dist[u] + cost;
// If vertex v is in Queue
if (!inQueue[v])
{
q.push(v);
inQueue[v] = true;
cnt[v]++;
// Negative cycle
if (cnt[v] >= V)
return true;
}
}
}
}
// No cycle found
return false;
}
// Driver Code
// Number of vertices
var N = 4;
// Given source node src
var src = 0;
// Number of Edges
var M = 4;
// Given Edges with weight
var Edges = [[0, 1, 1],
[1, 2, -1],
[2, 3, -1],
[3, 0, -1]];
// If cycle is present
if (sfpa(N, src, Edges, M) == true)
document.write("Yes" + "<br>");
else
document.write("No" + "<br>");
</script>
Time Complexity: O(N*M), where N is the number of vertices and M is the number of edges.
Auxiliary Space: O(N + M)
Similar Reads
Detect a negative cycle in a Graph | (Bellman Ford)
Given a directed weighted graph, your task is to find whether the given graph contains any negative cycles that are reachable from the source vertex (e.g., node 0).Note: A negative-weight cycle is a cycle in a graph whose edges sum to a negative value.Example:Input: V = 4, edges[][] = [[0, 3, 6], [1
15+ min read
Print negative weight cycle in a Directed Graph
Given a weighted directed graph consisting of V vertices and E edges. The task is to print the cyclic path whose sum of weight is negative. If there is no such path present then print "-1". Input: V = 5, E = 5, Below is the graph: Here, for the given negative cycle o/p (1->2->3->4->1) ;
14 min read
Dijkstra’s shortest path algorithm using set
Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Example:Input: src = 0, V = 5, edges[][] = [[0, 1, 4], [0, 2, 8],
8 min read
Detect Cycle in a directed graph using colors
Given a directed graph represented by the number of vertices V and a list of directed edges, determine whether the graph contains a cycle.Your task is to implement a function that accepts V (number of vertices) and edges (an array of directed edges where each edge is a pair [u, v]), and returns true
9 min read
Detect cycle in an undirected graph using BFS
Given an undirected graph, the task is to determine if cycle is present in it or not.Examples:Input: V = 5, edges[][] = [[0, 1], [0, 2], [0, 3], [1, 2], [3, 4]]Undirected Graph with 5 NodeOutput: trueExplanation: The diagram clearly shows a cycle 0 → 2 → 1 → 0.Input: V = 4, edges[][] = [[0, 1], [1,
6 min read
Longest Path in a Directed Acyclic Graph | Set 2
Given a Weighted Directed Acyclic Graph (DAG) and a source vertex in it, find the longest distances from source vertex to all other vertices in the given graph. We have already discussed how we can find Longest Path in Directed Acyclic Graph(DAG) in Set 1. In this post, we will discuss another inter
14 min read
Shortest Path in Directed Acyclic Graph
Given a Weighted Directed Acyclic Graph and a source vertex in the graph, find the shortest paths from given source to all other vertices. Recommended PracticeShortest path from 1 to nTry It! For a general weighted graph, we can calculate single source shortest distances in O(VE) time using Bellman–
15 min read
Print Nodes which are not part of any cycle in a Directed Graph
Given a directed graph G N nodes and E Edges consisting of nodes valued [0, N – 1] and a 2D array Edges[][2] of type {u, v} that denotes a directed edge between vertices u and v. The task is to find the nodes that are not part of any cycle in the given graph G. Examples: Input: N = 4, E = 4, Edges[]
14 min read
D'Esopo-Pape Algorithm : Single Source Shortest Path
Given an undirected weighted graph with v vertices labeled from 0 to v - 1, and a list of edges represented as a 2D array edges[][], where each entry is of the form [a, b, w] indicating an undirected edge between vertex a and vertex b with weight w. You are also given a source vertex src.The task is
11 min read
Number of shortest paths in an unweighted and directed graph
Given an unweighted directed graph, can be cyclic or acyclic. Print the number of shortest paths from a given vertex to each of the vertices. For example consider the below graph. There is one shortest path vertex 0 to vertex 0 (from each vertex there is a single shortest path to itself), one shorte
11 min read