Basic
A graph is an ADT, here ADT refers to the Abstract Data Type, and it can be used to represent non-linear relationships and complex relationships between objects. A graph consists of nodes commonly known as vertices, that are connected by edges. Graphs have a lot of key terms: When an edge connects two nodes, they are called neighbors. In this, we have covered all the classic problems related to graphs. Basically starting from graph traversals and gradually increasing the level by discussing all the classic problems.
Traversals
Graph traversal means visiting each vertex and edge in order. We must also verify that each vertex of the graph is visited exactly once when using certain graph algorithms. The order in which these vertices are visited is crucial, and it may be determined by the algorithm or question you're working on It's critical to keep track of which vertices have been visited throughout a traversal. Marking vertices as marked is the most popular method of tracking them.
Rotting Oranges Problem
By Akshat Chaturvedi
● Published At Jan 2022
In this blog post, we’ll learn the rotting oranges problem and how to code it in C++ with brute force and a time-efficient approach. ... Keep reading ..
Check if the end of the Array can be reached from a given position.
By Urwashi Priya
● Published At Nov 2021
This article will brief you on the problem to Check if the end of the Array can be reached from a given position. ... Keep reading ..
Minimize Steps Required to Convert Number N to M.
By Soumya Agrawal
● Published At Jan 2022
This blog will cover the problem of finding the minimum steps required to convert the number N to M using arithmetic operators and discuss its Time and Space complexity.... Keep reading ..
Check if it is possible to reach the index with value K when the start index is given.
By Urwashi Priya
● Published At Nov 2021
This article will brief you on the problem to Check if it is possible to reach the index with value K when the start index is given. ... Keep reading ..
Check If Cells Numbered 1 to K In A Grid Can Be Connected After The Removal Of At most One Blocked Cell
By Rhythm Jain
● Published At Dec 2021
This article discusses the problem of checking If Cells Numbered 1 to K In A Grid Can Be Connected After the Removal Of At most One Blocked Cell.... Keep reading ..
Kahn's Algorithm
By Shubham Agarwal
● Published At Jan 2022
The blog covers Kahn’s Algorithm, which is a method to achieve Topological Sorting including finding indegree with multiple modes, the time and space complexity.... Keep reading ..
Minimum Spanning Tree
A minimum spanning tree or minimum weight spanning tree can be defined as a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together.
Introduction and Properties of Minimum Spanning Tree
By Neelakshi Lahiri
● Published At Oct 2021
This article introduces a minimum spanning tree and discusses some of its essential properties. ... Keep reading ..
Travelling Salesman Problem | Part 2
By vaishnavi pandey
● Published At Oct 2021
In this article, we&#39;ll be seeing the dynamic programming approach to solving one of the classic optimisation problems, i.e. Travelling Salesman Problem. ... Keep reading ..
Problems
In Competitive programming, we can have problems like: 1. Array problems 2. Algorithm Based problems 3. Hashmap Based Problems and much more...
Shortest distance between two nodes in a Graph by reducing the weight of an edge by half
By Vibhor Bhatnagar
● Published At Jan 2022
In this article, we will discuss the problem to find the shortest distance between two nodes in a Graph by reducing the weight of an edge by half... Keep reading ..
Shortest path in a Matrix from top-left to bottom right-corner with neighbours exceeding at most K
By Ayush Prakash
● Published At Feb 2022
In this blog, we are going to solve a very interesting problem: Shortest path in a Matrix from top-left to bottom right-corner with neighbours exceeding at most K. We will also see the code implementation and discuss the space and time complexity. ... Keep reading ..
Minimum edges to be removed from undirected graph to remove any existing path between nodes A and B
By Vibhor Bhatnagar
● Published At Jan 2022
In this article, we will discuss the problem to find the minimum edges to be removed from undirected graph to remove any existing path between nodes A and B. ... Keep reading ..
Find the minimum number of edges to be removed such that no path exists between the given pair of vertices
By Gaurish Anand
● Published At Feb 2022
In this article, we will learn how to determine the minimum number of edges that need to be removed from the given graph such that no path exists between the given pair of vertices.... Keep reading ..
Count the number of nodes in a Graph whose sum of neighbors is at most K
By SHIKHAR SONI
● Published At Jan 2022
This article discusses the approach and implementation on how to count the number of nodes with the sum of neighbors at most K ... Keep reading ..
Find Eventual Safe States
By Pranav Gautam
● Published At Nov 2021
Learn to find the safe states in the given graph.... Keep reading ..