Advanced

The advanced topics under Graph Data Structure include traversable and Euclidean graphs, isomorphic and homogeneous graphs, fuzzy graphs, etc. Questions from these topics might be asked in the Technical Interviews of Product-Based Companies.

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 ..

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 ..

## Top Problems related to Advanced

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