Adjacency Lists from Input
Build the graph that contests give you.
What a Graph Really Is
A graph is just dots called nodes joined by lines called edges. Cities linked by roads is a graph you already know. 🗺️
Nodes and Edges
Each node is a thing, and each edge says two nodes are connected. Contest graphs usually number nodes from 1 to n.
All lessons in this course
- Adjacency Lists from Input
- BFS for Shortest Unweighted Paths
- DFS, Recursion & Iterative Stacks
- Connected Components & Flood Fill