Skip to main content
Back to course
Log in
Get started
Someone wanted to learn this too, so Grasp built them a personal learning path.
Create your own
Mastering Algorithms and Leetcode
·
Module 8
Graph Modeling and Traversal
1
Representing Relationships as Adjacency Lists
Convert relationship data into an adjacency-list graph representation.
Convert relationship data into an adjacency-list graph representation.
2
Breadth-First Search for Shortest Paths
Perform breadth-first search and record shortest distances in an unweighted graph.
Perform breadth-first search and record shortest distances in an unweighted graph.
3
Implementing Recursive Depth-First Search with Cycle Detection
Perform recursive depth-first search while using a visited set to prevent cycles.
Perform recursive depth-first search while using a visited set to prevent cycles.
4
Counting Connected Components in a Grid
Count connected components in a grid by treating neighboring cells as graph edges.
Count connected components in a grid by treating neighboring cells as graph edges.
5
Detecting Cycles in Undirected Graphs
Detect a cycle in an undirected graph using parent-aware traversal.
Detect a cycle in an undirected graph using parent-aware traversal.
6
Detecting Cycles in Directed Graphs
Detect a cycle in a directed graph using node visitation states.
Detect a cycle in a directed graph using node visitation states.
7
Kahn's Algorithm for Topological Sorting
Produce a topological ordering of a directed acyclic graph using indegrees.
Produce a topological ordering of a directed acyclic graph using indegrees.
8
Implementing Dijkstra's Algorithm with Priority Queues
Compute shortest paths with nonnegative edge weights using Dijkstra's algorithm and a heap.
Compute shortest paths with nonnegative edge weights using Dijkstra's algorithm and a heap.
Previous module
Binary Trees, Search Trees, and Heaps
Next module
Greedy Decisions, Intervals, and Connectivity