Graph
A graph is a type of non-linear data structure. A graph is defined as a group of vertices, and edges are used to connect these vertices. There are many different types of graphs, such as directed, undirected, weighted, unweighted, cyclic, acyclic, etc. There are many real-life applications of the graph. They are used in maps, social media, path optimization algorithms, etc.
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 cer
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 co
Problems
In Competitive programming, we can have problems like: 1. Array problems 2. Algorithm Based problems 3. Hashmap Based Problems and much more... 