Open In App

Graph Algorithms

Last Updated : 21 Jun, 2025
Summarize
Comments
Improve
Suggest changes
Share
Like Article
Like
Report

Graph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social network, a computer network, a network of locations used in GPS and many more examples where different nodes or vertices are connected without any hierarchic or constraint on structure.

Basics

BFS and DFS

Cycles

Shortest Path

Minimum Spanning Tree

Topological Sorting

Connectivity in Graph

Maximum Flow in Graph

Some must do Problems

If you are looking for difficulty-wise list of problems, please refer to Graph Data Structure.

Some Quizzes

Quick Links :

Recommended:


Introduction to Graph
Visit Course explore course icon
Video Thumbnail

Introduction to Graph

Video Thumbnail

Graph Representation (Adjacency Matrix)

Video Thumbnail

Graph Representation (Adjacency List)

Video Thumbnail

GRAPH Data Structure | What is Graph? | DSA Course

Next Article
Article Tags :
Practice Tags :

Similar Reads