I’m new to USACO, and I’ve focused most of my practice time on understanding sorting, two pointers, greedy algorithm… etc problems. I just recently started looking at some of the harder DFS graphing problems, and I just can’t find the right relationships in the graphs to get the problem right. With the contest coming up, how would you reccomend that I get an understanding of these concepts quickly? (I’ve read the guide material, it hasn’t really helped with more recent problems)