Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Strings3.3K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

DSA / Data Structures / Graph

Graph

951+ posts

Commonly Asked Data Structure Interview Questions on Graph

Last Updated: 03 March 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: 13 April 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: 02 September 2024

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: 02 September 2024

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

Depth First Search or DFS on Directed Graph

Last Updated: 09 August 2024

Depth-First Search (DFS) is a basic algorithm used to explore graph structures. In directed graphs, DFS can start from a specific point and explore all the connected nodes...read more

article_image

CSES Solutions - Even Outdegree Edges

Last Updated: 15 July 2024

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

CSES Solutions - Acyclic Graph Edges

Last Updated: 25 June 2024

Given an undirected graph, the task is to choose a direction for each edge so that the resulting directed graph is acyclic. You can print any valid solution.Example:Input:...read more

Competitive Programming

Difference Between Dijkstra's Algorithm and A* Search Algorithm

Last Updated: 21 June 2024

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: 14 June 2024

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

Check for Possible Bipartition

Last Updated: 11 June 2024

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

Minimum Time Required to Visit Each Disappearing Nodes

Last Updated: 14 June 2024

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

Kruskal's Algorithm in Python

Last Updated: 04 March 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

CSES Solutions - Company Queries II

Last Updated: 14 June 2024

A company has n employees, who form a tree hierarchy where each employee has a boss, except for the general director. Your task is to process q queries of the form: who is...read more

Competitive Programming

M-Coloring Problem in Python

Last Updated: 03 June 2024

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: 16 April 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

...