What are some good problems to do for Graph Theory for preparation of INOI ? asked 04 Jan '15, 00:22
showing 5 of 6
show all

You are not logged in. Please login at www.codechef.com to post your questions!
×CodeChef Discussion 
What are some good problems to do for Graph Theory for preparation of INOI ? asked 04 Jan '15, 00:22
showing 5 of 6
show all

Once you sign in you will be able to subscribe for any updates here
By RSS:Markdown Basics
Question tags:
question asked: 04 Jan '15, 00:22
question was seen: 995 times
last updated: 30 Jan '15, 15:35
Yeah someone please answer.
Doing all the previous graph theory problems in INOI, and the ones on the IARCS website should at least guarantee a strong understanding. Then you can explore COCI/BOI/IOI problems.
I want to try implementing Dijakstra's algorithm using adjacency matrix (other than FREETICKET) but many problems require implementation using priority queue. Any suggestions of such problems?
Why not just use FREETICKET?
I already used FREETICKET to understand how the algorithm worked and want more problems to apply what I have understood. Just for practice.
Also, do you by any chance have a simple implementation of Dijakstra's algorithm using priority queue/minheap without the structs, classes stuff? It's ok if it's long. If you do and if it's ok for you could you please post it?
http://codeforces.com/contest/20/submission/9616067