## 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… Read More »

- Count of elements which form a loop in an Array according to given constraints
- Minimum labelled node to be removed from undirected Graph such that there is no cycle
- Find any one of the multiple repeating elements in read only array | Set 2
- Check if given intervals can be made non-overlapping by adding/subtracting some X
- Print negative weight cycle in a Directed Graph
- Sum of minimum element at each depth of a given non cyclic 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… Read More »

Given an undirected graph consisting of N vertices numbered [0, N-1] and E edges, the task is to count the number of cycles such that… Read More »

Given a non-cyclic graph having V nodes and E edges and a source node S, the task is to calculate the sum of the minimum… Read More »

Given an N-sided regular polygon, we have connected all the vertices at the center of the polygon, thus dividing the polygon into N equal parts.… Read More »

Given a read-only array arr[] of size N + 1, find one of the multiple repeating elements in the array where the array contains integers… Read More »

Given an array arr[] containing N intervals, the task is to check that if the intervals can be added or subtracted by X after which… Read More »

Given an array A containing N integers, the task is to count the number of elements which form a cycle in the array, based on… Read More »

Given an undirected graph of N nodes labelled from 1 to N, the task is to find the minimum labelled node that should be removed… Read More »

Given an array Arr of N integers representing the nodes of a graph. The edges are defined between those pair whose bitwise AND is not… Read More »

Given an undirected unweighted graph. The task is to find the length of the shortest cycle in the given graph. If no cycle exists print… Read More »

Given a graph, the task is to detect a cycle in the graph using degrees of the nodes in the graph and print all the… Read More »

Given a graph G, the task is to check if it represents a Ring Topology. A Ring Topology is the one shown in the image… Read More »

Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least… Read More »

There are a total of n tasks you have to pick, labeled from 0 to n-1. Some tasks may have prerequisites, for example to pick… Read More »

Given the number of vertices in a Cycle Graph. The task is to find the Degree and the number of Edges of the cycle graph.… Read More »