hi...
i tried solving a few graph problems in a programming site
all of them exceeding the required time limit..(though i used standrd algotithms)
may be cos of the the time for graph construction...
i implemented adjacency linked list using structs and pointers....
how will i improvise
Dunno, if you don't post your code, we can't tell you how to improve it.
And no, this isn't an invite for you to PM me your code either.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
No, instead I got a PM that I only just answered to with a "I do not solve problems via PM".
--
Mats
Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
