Dear friends,

I'm a 10th standard student from Kerala. It was only recently that I got to know about IOI. And I have been solving many problems and learning things. I know dfs, bfs, and elementary graph theory. I want to learn everything, but lack of time is an issue for this year's ICO. I would like to know the extent to which I should know graph theory for INOI. Should I learn shortest path(I mean dijkstra's, floyd-warshal) algorithms? Any help would be greatly appreciated.