Problems
Dynamic Programming and graphs are some of the most important topics in computer science as well as from a placement point of view. When we apply the concept of DP to graphs, we can get optimized results. Let us look at some problems to understand its application better.
Shortest Distance Between Given Nodes in a Bidirectional Weighted Graph by Removing any K Edges
By Anant Dhakad
● Published At Dec 2021
In this article, we will take a coding problem based on DFS. We will learn to explore all paths using DFS traversal and efficiently find the sum of K largest elements using minHeap.... Keep reading ..
Print all Hamiltonian Cycles in an Undirected Graph.
By Urwashi Priya
● Published At Jan 2022
This article will brief you on how to Print all Hamiltonian Cycles in an Undirected Graph. ... Keep reading ..
Maximum Bitwise XOR of values of nodes of an Acyclic Graph made up of N given vertices using M edges
By Urwashi Priya
● Published At Jan 2022
This article will brief you to find the Maximum Bitwise XOR of values of nodes of an Acyclic Graph made up of N given vertices using M edges. ... Keep reading ..
Floyd Warshall Algorithm
By Manvi Chaddha
● Published At Oct 2021
Floyd Warshall Algorithm is an important Graph algorithm, and this article provides a crisp explanation of it along with code in Java.... Keep reading ..
Determine whether we can travel to every node under the given conditions
By Gaurish Anand
● Published At Feb 2022
In this article, we will learn whether we can travel to every node under the given conditions.... Keep reading ..
Find palindromic path of given length K in a complete Binary Weighted Graph
By Anant Dhakad
● Published At Dec 2021
This blog will discuss a problem involving palindromes and complete graphs. ... Keep reading ..
Maximum sum of distances of a node to every other node
By Shreya Deep
● Published At Jan 2022
This article describes the ways to find the maximum sum of distances of a node to every other node... Keep reading ..
Maximize Difference between pair of Nodes in a given rooted Tree such that one Node is Ancestor of another
By Malay Gain
● Published At Mar 2022
In this article, we will learn how to maximize the difference between pair of nodes in a given rooted tree such that one node is the ancestor of another. ... Keep reading ..
Smallest Vertex in the Connected Components of all the Vertices in the Given Undirected Graph
By Abhishek Ranjan
● Published At Dec 2021
In this article, we will solve a problem using union-find data structure.... Keep reading ..