Multistage Graph (Shortest Path)
A Multistage graph is a directed graph in which the nodes can be divided into a set of stages such that all edges are from… Read More »
Category Archives: Graph
Transpose graph
Transpose of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the… Read More »
Shortest path in an unweighted graph
Given a unweighted graph, a source and a destination, we need to find shortest path from source to destination in the graph in most optimal… Read More »
Minimize the number of weakly connected nodes
Given an undirected graph, task is to find the minimum number of weakly connected nodes after converting this graph into directed one. Weakly Connected Nodes… Read More »
Number of Unicolored Paths between two nodes
Given an undirected colored graph(edges are colored), with a source vertex ‘s’ and a destination vertex ‘d’, print number of paths which from given ‘s’… Read More »
Number of loops of size k starting from a specific node
Given two positive integer n, k. Consider an undirected complete connected graph of n nodes in a complete connected graph. The task is to calculate… Read More »
Fibonacci Cube Graph
You are given input as order of graph n (highest number of edges connected to a node), you have to find number of vertices in… Read More »
Eulerian Path in undirected graph
Given an adjacency matrix representation of an undirected graph. Find if there is any Eulerian Path in the graph. If there is no path print… Read More »
Construct binary palindrome by repeated appending and trimming
Given n and k, Construct a palindrome of size n using a binary number of size k repeating itself to wrap into the palindrome. The… Read More »
Hypercube Graph
You are given input as order of graph n (highest number of edges connected to a node), you have to find number of vertices in… Read More »
Magical Indices in an array
Given an array A of integers. Index i of A is said to be connected to index j if j = (i + A[i]) %… Read More »
Check for star graph
You are given an n * n matrix which represent a graph with n-vertices, check whether the input matrix represent a star graph or not.… Read More »
Paths to travel each nodes using each edge (Seven Bridges of Königsberg)
There are n nodes and m bridges in between these nodes. Print the possible path through each node using each edges (if possible), traveling through… Read More »
Permutation of numbers such that sum of two consecutive numbers is a perfect square
Prerequisite: Hamiltonian Cycle Given an integer n(>=2), find a permutation of numbers from 1 to n such that the sum of two consecutive numbers of… Read More »
Minimum cost to connect all cities
There are n cities and there are roads in between some of the cities. Somehow all the roads are damaged simultaneously. We have to repair… Read More »