The Jump pointer algorithm is a design technique for parallel algorithms that operate on pointer structures, such as arrays or linked list. This algorithm is… Read More

# Category Archives: Graph

Given an undirected graph, check if it contains an independent set of size k. Print ‘Yes’ if there exists an independent set of size k.… Read More

Given a graph with n nodes and m edges. Find the maximum possible number of nodes which are not part of any edge (m will… Read More

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are… Read More

We are given m*n matrix which can have a number between 0 and 7. Each number represents a pipe with a shape as follows: Two… Read More

Given a boolean 2D matrix. The task is to find the number of distinct islands where a group of connected 1s (horizontally or vertically) forms… Read More

Given ‘n’ vertices and ‘m’ edges of a graph. Find the minimum number and maximum number of isolated vertices that are possible in the graph. Examples: … Read More

Given a weighted Directed Graph where the weights may be negative, find the shortest path between every pair of vertices in the Graph using Johnson’s… 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

Wheel Graph: A Wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. Properties:- Wheel graphs are… Read More

Given the number of Vertices and the number of Edges of an Undirected Graph. The task is to determine the Circuit rank.Circuit Rank: The Circuit… Read More

Consider a directed graph given in below, DFS of the below graph is 1 2 4 6 3 5 7 8. In below diagram if… Read More

Given the number of vertices in a Cycle graph. The task is to find the Total number of Spanning trees possible. Note: A cycle/circular graph is… Read More

Given the number of vertices N of a graph. The task is to determine the Edge cover.Edge Cover: Minimum number of edge required to cover… Read More

Cycle:- cycle is a path of edges and vertices wherein a vertex is reachable from itself. or in other words, it is a Closed walk. … Read More