Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Graphs: Data Structures and Algorithms: Uncharted

Courses Data Structures and AlgorithmsGraphs

GraphsPro

Model networks, traverse them breadth-first and depth-first, and order dependencies.

Data Structures and Algorithms
Unit 11 of 16
20 lessons
128 min
420 XP

This unit is part of Pro. Upgrade to open every lesson in it.

Lessons

20 total

1Everything Is a NetworkAbstract a domain into graph vertices, edges, and direction before selecting an algorithm.ProInteractiveConcept6 min20 XPOpen
2Adjacency ListsApply undirected edge-list to adjacency-list conversion to building neighbor lists from undirected friend pairs.ProCodeConcept6 min20 XPOpen
3Draw the GraphEncode the exact directed edge list with each vertex created once and no missing, reversed, or extra edge.ProDiagramConcept6 min20 XPOpen
4Degrees and NeighborsApply adjacency degree and neighbor query to reporting one person’s direct friends and degree.ProCodeConcept6 min20 XPOpen
5BFS RipplesApply sorted-neighbor breadth-first traversal to visiting a friend map level by level with alphabetical neighbor ties.ProCodeConcept6 min20 XPOpen
6Hops to AnyoneApply breadth-first unweighted distance map to measuring how many introductions separate the start from every reachable person.ProCodeConcept6 min20 XPOpen
7The Way BackApply BFS parent-map path reconstruction to recording BFS parents and reconstructing a shortest unweighted path.ProCodeConcept6 min20 XPOpen
8Predict the BFSPredict deterministic BFS order by tracking discovery, queue state, and alphabetical neighbor ties.ProInteractiveConcept6 min20 XPOpen
9DFS DiveApply recursive depth-first traversal to following one alphabetical branch completely before returning.ProCodeConcept6 min20 XPOpen
10DFS with a StackApply explicit-stack depth-first traversal to replacing recursion with an explicit stack for deep graphs.ProCodeConcept6 min20 XPOpen
11Count the IslandsApply iterative grid flood fill to treating four-direction land cells as graph neighbors and flood-filling each island.ProCodeConcept6 min20 XPOpen
12Connected ComponentsApply component-by-component graph traversal to labeling every separate friend group, including isolated people.ProCodeConcept6 min20 XPOpen
13Cycle or NotApply visited-plus-parent undirected cycle detection to detecting an undirected loop without mistaking the parent edge for a cycle.ProCodeConcept6 min20 XPOpen
14Direction Changes EverythingDetermine reachability and degree using only the permitted direction of each graph edge.ProInteractiveConcept6 min20 XPOpen
15Course PrerequisitesApply Kahn queue topological ordering to using Kahn’s queue to place every prerequisite before the task that depends on it.ProCodeConcept6 min20 XPOpen
16Detect the DeadlockApply topological-leftover directed cycle detection to detecting a directed dependency cycle from nodes left after topological removal.ProCodeConcept6 min20 XPOpen
17The Maze Is a GraphApply grid breadth-first shortest path to finding the shortest open-cell route through a grid maze with BFS.ProCodePractice8 min20 XPOpen
18Six DegreesApply BFS introduction-chain reconstruction to printing the shortest introduction chain between two people.ProCodePractice8 min20 XPOpen
19Graph or Not?Define meaningful vertices, edges, direction, and target query for a network brief.ProInteractiveConcept6 min20 XPOpen
20Graphs Mastery CheckApply BFS components and cycle synthesis to combining BFS order, component counting, and undirected cycle detection.ProCodeMastery check10 min40 XPOpen

Heaps and Priority Queues Weighted Graphs and Union-Find