Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Data Structures and Algorithms
·
Module 11
Graph Traversal Algorithms
1
Graph Representation: Adjacency Lists & Matrices
Represent graphs using adjacency lists and adjacency matrices.
2
Shortest Path with BFS
Implement Breadth-First Search (BFS) to find the shortest path in unweighted graphs.
3
Exploring Graphs with DFS
Implement Depth-First Search (DFS) for graph exploration and path finding.
4
Grid Traversal: BFS and DFS for Island Problems
Solve grid-based graph problems like 'Number of Islands' using BFS or DFS.
5
Dijkstra's Algorithm: Finding the Shortest Path
Implement Dijkstra's algorithm to find the shortest path in a weighted graph.
Previous module
Dynamic Programming
Next module
Advanced Graph Concepts and Problems