You solved six mixed problems and learned to recognize patterns:
BFS for shortest unweighted paths. DFS for cycle detection. Multi-source BFS for multiple starting points. DP on DAG for longest paths and counting.
The core skill is pattern matching: look at the problem, identify the graph property, pick the technique.
Next section starts tree algorithms.