Topological sort, DFS from boundaries, union-find, and tree validation. Apply graph algorithms to real problems.
Pick any problem to start. Easy ones are great for warming up.