The conversation between human and AI assistant.
What are some basic graph theory questions (BFS/DFS/SCC/shortest paths/topo/that sort) from online judges like SPOJ and CodeChef, in increasing order of difficulty? I'm not good at even identifying graph questions.
I'm looking for some basic graph theory questions on online judges like SPOJ and CodeChef. Do you know any examples?
Certainly! Here are a few examples in increasing order of difficulty: BFS, DFS, SCC, shortest paths, and topo sorting. Would you like me to explain what each of these are?