Hi all,

I learnt some graph theory recently and I am quite fascinated by it. So, I wanted to check out some really interesting problems under that topic. What are some of the best problems that you've solved which have a graph algorithm (like shortest path, SCCs, euler tour, max-flow, bridges/articulation points) as their solution?

I have observed that in recent contests, the ones which were Div 1 + Div 2 had more interesting and harder problems than those which were only Div 2. I'm talking about problems C, D and E (or A, B and C of Div 1), if you compare any recent Div 1's A, B, C to any recent Div 2 only's C, D, E, I think the former would be more interesting to solve. Do you guys feel the same too?