## Minimum number of colors required to color a graph

Given a graph with N vertices and E edges. The edges are given as U[] and V[] such that for each index i, U[i] is… Read More »

Given a graph with N vertices and E edges. The edges are given as U[] and V[] such that for each index i, U[i] is… Read More »

Prerequisites: Bellman-Ford Algorithm Given a directed weighted graph with V vertices, E edges and a source vertex S. The task is to find the shortest… Read More »

Given adjacency list representation of a directed graph, the task is to check whether the cost of going from any vertex to any other vertex… Read More »

Given a directed weighted graph with N vertices and M edges and an edge (U, V). The task is to find whether there is an… Read More »

Given a number N which is the number of nodes in a graph, the task is to find the maximum number of edges that N-vertex… Read More »

Given a graph with N nodes, a node S and Q queries each consisting of a node D and K, the task is to find… Read More »

Prerequisite: Graph and its representations Given a adjacency matrix representation of a Graph. The task is to convert the given Adjacency Matrix to Adjacency List… Read More »

Prerequisite: Segment tree and depth first search. In this article, an approach to convert an N-ary rooted tree( a tree with more than 2 children)… Read More »

Prerequisites: Genetic Algorithm, Travelling Salesman Problem In this article, a genetic algorithm is proposed to solve the travelling salesman problem. Genetic algorithms are heuristic search… Read More »

Given a small graph with N nodes and E edges, the task is to find the maximum clique in the given graph. A clique is… Read More »

Given an undirected graph with N nodes and E edges and a value K, the task is to print all set of nodes which form… Read More »

Prerequisites: Linked List, Graph Data Structure In this article, adding and removing a vertex is discussed in a given adjacency list representation. Let the Directed… Read More »

Prerequisites: Graph and Its Representation In this article, adding and removing edge is discussed in a given adjacency list representation. A vector has been used… Read More »

Given a directed graph with N nodes and E edges where the weight of each of the edge is > 1, also given a source… Read More »

Given a bi-directed weighted (positive) graph without self-loops, the task is to generate the minimum spanning tree of the graph. Examples: Input: N = 9,… Read More »