DP and Graph

DP and Graph is a little uncommon for interviews but is essential to become a great competitive programmer. However, there are certain standard problems under this category, like Multistage Graph. These problems are generally termed as "Hard" and are a bit difficult to find. Let's learn about it in greater detail.

Count all Hamiltonian Paths in a Directed Graph

By GAZAL ARORA

● Published At Jan 2022

The path that visits every vertex of the graph exactly once is known as a Hamiltonian path. In this article, we will count all the Hamiltonian paths in a given directed graph.... Keep reading ..

Count Number of Connected Components

By Malay Gain

● Published At Apr 2022

We will discuss the algorithm to count the number of connected components in an undirected graph.
... Keep reading ..

Bellman Ford Algorithm

By Hari Sapna Nair

● Published At Oct 2021

This blog covers the Bellman Ford algorithm based on graph data structure along with the code in Java.
... Keep reading ..

Bipartite Graph

By Yukti Kumari

● Published At Oct 2021

This article explains the bipartite graph, its properties and algorithm to determine if a graph is bipartite or not, along with its space and time complexity.... Keep reading ..

Travelling Salesman Problem | Part 1

By vaishnavi pandey

● Published At Oct 2021

In this article, we'll be seeing the basic approach to solving one of the classic optimisation problems, i.e. Travelling Salesman Problem.
... Keep reading ..

## Top Problems related to DP and Graph

Colour The Graph

Properties of MST in a Undirected Graph

Detect Cycle in a Undirected Graph

Alien dictionary

DFS Traversal

Minimum Time in Wormhole Network

Minimum Spanning Tree

Count Ways

Detect Cycle in an Undirected Graph

Bridges In A Graph

Minimum steps to reach target by a Knight

Dijkstra's shortest path

Reachable Nodes

Path Queries

Shortest Path

Path Reversals

Road Constructor

Check If Path Exists

Roads

Number Of Triangles In An Undirected Graph

Detect Cycle in a Directed Graph