Slug: graph-arena-01 · Paired reading: Chapter 21
Prompt
fn undirected_adjacency(n: usize, edges: &[(usize, usize)]) -> Vec<Vec<usize>>
— build an adjacency list for an undirected graph on nodes 0..n.
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? The landing page stays open — purchase unlocks this gym.
intermediate · order 129
Slug: graph-arena-01 · Paired reading: Chapter 21
fn undirected_adjacency(n: usize, edges: &[(usize, usize)]) -> Vec<Vec<usize>>
— build an adjacency list for an undirected graph on nodes 0..n.