My ICT teacher asked me to give a short lecture at school on a programming topic I'm interested in. I chose finding strongly connected components in a directed graph. I'd like to include a problem to have some context.

Can you recommend simple SCC problems with no other algorithm needed I can use for the lecture?