# Category Archives: Graph

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
Given a directed graph with N nodes and M connections shown in the matrix mat[] where each element is of the form {xi, yi} denoting… Read More
Prerequisite: NP-Completeness, NP Class, Sparse Graph, Independent Set Problem: Given graph G = (V, E) and two integers a and b. A set of a… Read More
Given a set of cities and the distance between every pair of cities, the problem is to find the shortest possible route that visits every… Read More
Prerequisite: NP-Completeness, NP Class, Clique, Independent Set Problem: Given an undirected graph G = (V, E) and an integer K, determine if a clique of… Read More
Prerequisites: NP-Completeness, NP Class, Dense Subgraph  Problem: Given graph G = (V, E) and two integers a and b. A set of a number of… Read More
What is Data Structure: A data structure is a storage that is used to store and organize data. It is a way of arranging data… Read More
A weighted graph is a special type of graph in which the edges are assigned some weights which represent cost, distance and many other relative… Read More
Unweighted graph is a type of graph with no edge weight. In an unweighted graph, the edges represent the connection between two nodes. If there… Read More
Given a directed graph with N nodes and M edges in array V[], the task is to find the number of nodes that are accessible… Read More
Directed graphs are graphs that have directed edges between the nodes. If a directed edge points from u to v then, v is adjacent to… Read More
Graph is a non-linear data structure that contains nodes (vertices) and edges. A graph is a collection of set of vertices and edges (formed by… Read More
Given an integer N and an array arr[] of M pairs of type (Ai, Bi), the task is to generate the lexicographically smallest possible permutation… Read More