Minimum cost to reverse edges such that there is path between every pair of nodes
Given a connected, directional graph. Each node is connected to exactly two other nodes. There is weight associated with each edge denoting the cost to… Read More »
Category Archives: Graph
Check if given path between two nodes of a graph represents a shortest paths
Given an unweighted directed graph and Q queries consisting of sequences of traversal between two nodes of the graph, the task is to find out… Read More »
Minimum number of edges that need to be added to form a triangle
Given an undirected graph with N vertices and N edges. No two edges connect the same pair of vertices. A triangle is a set of… Read More »
Find count of pair of nodes at even distance
Given a connected acyclic graph with N nodes and N-1 edges, find out the pair of nodes that are at even distance from each other.… Read More »
Print completed tasks at end according to Dependencies
Given N dependencies of the form X Y, where X & Y represents two different tasks. The dependency X Y denotes dependency of the form… Read More »
Check if there exists a connected graph that satisfies the given conditions
Given two integers N and K. The task is to find a connected graph with N vertices such that there are exactly K pairs (i,… Read More »
Welsh Powell Graph colouring Algorithm
In graph theory, vertex colouring is a way of labelling each individual vertex such that no two adjacent vertex have same colour. But we need… Read More »
Word Ladder – Set 2 ( Bi-directional BFS )
Given a dictionary, and two words start and target (both of the same length). Find length of the smallest chain from start to target if… Read More »
Print nodes having maximum and minimum degrees
Given an undirected graph having N nodes, the task is to print the nodes having minimum and maximum degree. Examples: Input: 1—–2 | | 3—–4… Read More »
Widest Path Problem | Practical application of Dijkstra’s Algorithm
It is highly recommended to read Dijkstra’s algorithm using the Priority Queue first. Widest Path Problem is a problem of finding a path between two… Read More »
Convert Directed Graph into a Tree
Given an array arr[] of size N. There is an edge from i to arr[i]. The task is to convert this directed graph into tree… Read More »
Implementation of BFS using adjacency matrix
Breadth First Search (BFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be… Read More »
Find the minimum number of moves to reach end of the array
Given an array arr[] of size N where every element is from the range [0, 9]. The task is to reach the last index of… Read More »
Find if a degree sequence can form a simple graph | Havel-Hakimi Algorithm
Given a sequence of non-negative integers arr[], the task is to check if there exists a simple graph corresponding to this degree sequence. Note that… Read More »
Print all neighbour nodes within distance K
Given a graph of N nodes, E edges, a node X and a distance K. The task is to print all the nodes within the… Read More »
