## Maximal Independent Set in an Undirected Graph

Given an undirected graph defined by the number of vertex V and the edges E[ ], the task is to find Maximal Independent Vertex Set… Read More »

- Breadth First Search without using Queue
- Shortest Path Faster Algorithm
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Add and Remove Edge in Adjacency List representation of a Graph
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Count total ways to reach destination from source in an undirected Graph
- Real-time application of Data Structures
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
- Add and Remove vertex in Adjacency List representation of Graph
- Program to print all the non-reachable nodes | Using BFS
- Diamond Tree
- Find if there is a path between two vertices in an undirected graph
- Paranthesis Theorem
- Minimum number of colors required to color a graph
- Shortest path with exactly k edges in a directed and weighted graph | Set 2
- Number of pairs such that path between pairs has the two vertices A and B
- Minimum Spanning Tree using Priority Queue and Array List
- Shortest path in a directed graph by Dijkstra’s algorithm
- Build a segment tree for N-ary rooted tree
- Find a Mother vertex in a Graph using Bit Masking
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- Shortest path in a graph from a source S to destination D with exactly K edges for multiple Queries
- Check if a Tree can be split into K equal connected components
- D'Esopo-Pape Algorithm : Single Source Shortest Path
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Maximal Clique Problem | Recursive Solution

Given an undirected graph defined by the number of vertex V and the edges E[ ], the task is to find Maximal Independent Vertex Set… Read More »

Given a weighted directed graph consisting of V vertices and E edges. The task is to print the cyclic path whose sum of weight is… Read More »

Given an undirected graph with V vertices and E edges, the task is to print all the independent sets and also find the maximal independent… Read More »

Given a Directed Graph and two vertices in it, check whether there is a path from the first given vertex to second. Example: Consider the… Read More »

Given a Directed Acyclic Graph (DAG), having N vertices and M edges, The task is to print all path starting from vertex whose in-degree is… Read More »

Given an unweighted directed graph G as a path matrix, the task is to find out if the graph is Strongly Connected or Unilaterally Connected… Read More »

Given an undirected graph having N vertices and M edges and each vertex is associated with a cost and a source vertex S is given.… Read More »

Given an undirected non-weighted graph G. For a given node start return the shortest path that is the number of edges from start to all… Read More »

Given an undirected graph, the task is to count the maximum number of Bridges between any two vertices of the given graph. Examples: Input: Graph… Read More »

Given two integers N and M, the task is to find out minimum number of operations required to convert N to M. Each operation involves… Read More »

Given a graph G with V nodes and E edges, the task is to colour no more than floor(V/2) nodes such that every node has… Read More »

Given a graph and two nodes u and v, the task is to print the shortest path between u and v using the Floyd Warshall… Read More »

Prerequisite: NP-Completeness, Clique problem. A clique in a graph is a set of vertices where each vertex shares an edge with every other vertex. Thus,… Read More »

Given an undirected graph consisting of N vertices numbered [0, N-1] and E edges, the task is to count the number of cycles such that… Read More »

Given two N-ary trees having M nodes each. Also, given their edges and their roots respectively. The task is to check if they are isomorphic… Read More »