What is Dijkstra’s Algorithm? Dijkstra’s Algorithm is used for finding the shortest path between any two vertices of a graph. It uses a priority queue… Read More

# Category Archives: Graph

Given a 2-D array A[][] of size N × 3, where each element of the array is of the form {x, y, z}, where x,… Read More

To understand this let’s take a binary tree Binary tree If we conduct BFS in this tree: In level 0 there is one node in… Read More

BFS and DFS are two algorithms that we use for graph traversal. In both the algorithms we start from a node and iterate over the… Read More

For N given cities, find how many ways a driver can traverse through them so that each town is visited exactly K times. From each… Read More

A graph is a data structure that is defined by two components : A node or a vertex. An edge E or ordered pair is… Read More

In the field of graph theory, various shortest path algorithms especially Dijkstra’s algorithm and Bellmann-Ford’s algorithm repeatedly employ the use of the technique called Edge… Read More

Given a 2D array arr[] and value K, where each list in arr[] represents a point on Cartesian coordinates, the task is to group the… Read More

Given N nodes, where each of them is numbered from 0 to N – 1, and array edges, where there is a directed edge from… Read More

Given a 2-D array A[][] of size N×3, where each element of the array consists of {x, y, r}, where x and y are coordinates… Read More

Generally, when we come across a graph problem, we might need to traverse the structure of the given graph or tree to find our solution… Read More

Given an undirected graph with V vertices in the form of an adjacency matrix, the weight of any two edges cannot be the same. For… Read More

Given a weighted directed graph with N vertices and M edges, a source src and a destination target, the task is to find the shortest… Read More

A Data Structure organizes and stores data in a computer so that we can perform operations on the data more efficiently. There are many diverse… Read More

A clique is a collection of vertices in an undirected graph G such that every two different vertices in the clique are nearby, implying that… Read More