Who Can I Reach? Depth-First Search
Find everyone a person can reach through friends, and split a network into the groups that don't touch, with a short recursive walk that never goes round in circles: why the folder walk from Module 3 loops forever here, and the search that fixes it, depth-first search, and when to choose it over breadth-first search.
Updated
- Category
- Data Structures
- Level
- Journeyman
- Tags
- Breadth-First Search, Connected Component, data structures, Depth-First Search, Graph, Recursion (data-structures)