Tutorials
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Misc7.8K+ articles

Mathematical5.1K+ articles

Greedy1.4K+ articles

Tree909+ articles

Recursion590+ articles

DFS359+ articles

BFS228+ articles

graph-connectivity64+ articles

DSA / Data Structures / Graph

Graph

560+ posts

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

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

article_image

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

article_image

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

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

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

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

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

article_image

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

article_image

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

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

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

article_image

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

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

article_image

...