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.
Understand and apply algorithms
·
Module 10
Graph Algorithms
1
Introduction to Graph Types
Define a graph and distinguish between directed, undirected, weighted, and unweighted graphs.
2
Adjacency List Representation in Python
Represent a graph using an adjacency list in Python.
3
Graph Traversal with BFS and Queues
Implement Breadth-First Search (BFS) using a queue to traverse a graph.
Recursive Depth-First Search for Graph Traversal
Implement Depth-First Search (DFS) using recursion to traverse a graph.
5
BFS for Shortest Paths in Unweighted Graphs
Solve a shortest path problem on an unweighted graph using BFS.
Graph Traversal: Counting Connected Components
Solve a problem involving graph traversal, such as counting connected components.
Previous module
Trees and Binary Search Trees
Next module
Introduction to Dynamic Programming