## Ways to Remove Edges from a Complete Graph to make Odd Edges

Given a complete graph with N vertices, the task is to count the number of ways to remove edges such that the resulting graph has… Read More »

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

Given a complete graph with N vertices, the task is to count the number of ways to remove edges such that the resulting graph has… Read More »

Given a connected graph with N vertices and M edges. The task is to print the lexicographically smallest DFS traversal of the graph starting from… Read More »

Given a graph containing N nodes. For any permutation of nodes P1, P2, P3, …, PN the value of the permutation is defined as the… Read More »

Given an undirected complete graph of N vertices where N > 2. The task is to find the number of different Hamiltonian cycle of the… Read More »

Given a directed graph and a node X. The task is to find the minimum number of edges that must be added to the graph… Read More »

Given a connected graph with N vertices and M edges. The task is to print the lexicographically smallest BFS traversal of the graph starting from… Read More »

Given an integer l and a tree represented as an undirected graph rooted at vertex 0. The task is to print the number of nodes… Read More »

Given an undirected graph of V nodes (V > 2) named V1, V2, V3, …, Vn. Two nodes Vi and Vj are connected to each… Read More »

Given an undirected graph G(V, E) with N vertices and M edges. We need to find the minimum number of edges between a given pair… Read More »

Given two integers n and m which are the dimensions of a grid. The task is to find the cost of painting the grid cell… Read More »

Given two integers N and M, the task is to count the number of simple undirected graphs that can be drawn with N vertices and… Read More »

Given a grid grid[][] with 4 types of blocks: 1 represents the starting block. There is exactly one starting block. 2 represents the ending block.… Read More »

Given an undirected graph with multiple connected components, the task is to clone the graph. Cloning a graph with a single connected component can be… Read More »

Given a starting position ‘k’ and two jump sizes ‘d1’ and ‘d2’, our task is to find the minimum number of jumps needed to reach… Read More »

Given an adjacency list representation of a directed graph, the task is to find the path from source to every other node in the graph… Read More »