Tutorials
Go Premium
Data Structure
Java
Python
HTML
Interview Preparation
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
SQL
Web Development
System Design
Aptitude
GfG Premium
Similar Topics
Web Technologies
32.1K+ articles
DSA
20.0K+ articles
Misc
7.8K+ articles
Mathematical
5.1K+ articles
Greedy
1.4K+ articles
Tree
909+ articles
Recursion
590+ articles
DFS
359+ articles
BFS
228+ articles
graph-connectivity
64+ articles
DSA
/
Data Structures
/
Graph
Graph
560+ posts
Recent Articles
Popular Articles
Commonly Asked Data Structure Interview Questions on Graph
Last Updated: 23 July 2025
A graph is a non-linear data structure that consists of a set of nodes (also known as vertices) connected by edges. Unlike trees, which have a hierarchical structure, grap...
read more
Graph
DSA
Graph Data Structure
Last Updated: 23 July 2025
Graph Data Structureis a collection ofnodesconnected byedges. It's used to represent relationships between different entities. If you are looking for topic-wise list of pr...
read more
Graph
DSA
Dense Graph
Last Updated: 23 July 2025
Graphs are fundamental structures in computer science and mathematics used to model relationships between objects. Understanding the various types of graphs is essential f...
read more
Graph
Picked
DSA
Sparse Graph
Last Updated: 23 July 2025
Graphs are fundamental structures in computer science and mathematics and it is used to model relationships between objects. Understanding the various types of graphs is v...
read more
Graph
Picked
DSA
CSES Solutions - Even Outdegree Edges
Last Updated: 23 July 2025
Given an undirected graph, your task is to choose a direction for each edge so that in the resulting directed graph's each node has an even outdegree. The outdegree of a n...
read more
Graph
Picked
DSA
CSES Problems
Minimum Time Required to Visit Each Disappearing Nodes
Last Updated: 23 July 2025
Given an undirected graph with n nodes that are represented by a 2D array edges where edges[i] = [ui, vi, timei] describes an edge between nodes ui and vi with a traversal...
read more
Graph
Picked
DSA
Dijkstra
Facebook
Interview-Questions
Check for Possible Bipartition
Last Updated: 23 July 2025
Given a group of n people labeled from 1 to n, the task is to split them into two groups of any size such that no two people who dislike each other are in the same group. ...
read more
Graph
Picked
DSA
Uber
Interview-Questions
Difference Between Dijkstra's Algorithm and A* Search Algorithm
Last Updated: 23 July 2025
Dijkstra's Algorithm and A* Algorithm are two of the most widely used techniques. Both are employed to the find the shortest path between the nodes in a graph but they hav...
read more
Graph
DSA
Difference Between Hamiltonian Path and Eulerian Path
Last Updated: 23 July 2025
The Hamiltonian and Eulerian paths are two significant concepts used to the solve various problems related to the traversal and connectivity of the graphs. Understanding t...
read more
Graph
DSA
Kruskal's Algorithm in Python
Last Updated: 23 July 2025
Kruskal’s Algorithm is a greedy algorithm used to find MST in the graph. A minimum spanning tree (MST) is a spanning tree with a weight less than or equal to the weigh...
read more
Graph
Python
Picked
Python-DSA
M-Coloring Problem in Python
Last Updated: 23 July 2025
M-Coloring Problem is a classic algorithmic problem which involves coloring the vertices of a graph using at most M different colors such that no two adjacent vertices sha...
read more
Graph
Picked
DSA
Python-DSA
Find Course Schedule II
Last Updated: 23 July 2025
Given n courses, labeled from 0 to n - 1 and an array prerequisites[] where prerequisites[i] = [x, y] indicates that we need to take course y first if we want to take cour...
read more
Graph
Picked
DSA
Amazon
Topological Sorting
Prim's Algorithm in Python
Last Updated: 23 July 2025
Prim's algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. The MST is a subset of the edges that connects all ve...
read more
Graph
Picked
DSA
Python-DSA
Strongly Connected Components (SCC) in Python
Last Updated: 23 July 2025
Strongly Connected Components (SCCs) in a directed graph are groups of vertices where each vertex has a path to every other vertex within the same group. SCCs are essentia...
read more
Graph
Picked
DSA
Python-DSA
Kahn's Algorithm in Python
Last Updated: 23 July 2025
Kahn's Algorithm is used for topological sorting of a directed acyclic graph (DAG). The algorithm works by repeatedly removing nodes with no incoming edges and recording t...
read more
Graph
Picked
DSA
Python-DSA
1
2
3
4
...
38
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our
Cookie Policy
&
Privacy Policy
Got It !