to other people as well .
http://avishkar.mnnit.ac.in/iopc/iopc.php
Thanks
--
Chandrasekhar
Final Year CSE
NIT Allahabad
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To po
t sure how to keep nodes of a sequence together. Will try to think
about it.
Comment on the above. Let me know if i am wrong somewhere.
cheers
On 5/30/07, Chandrasekhar <[EMAIL PROTECTED]> wrote:
>
> i am sry... i meant topological sort n not search.
>
> and i think th
ts and keeping the
> original sequences together as much as possible.
>
> for example V T U W X Y Z X V is another ordering which satisfies the
> all original sequences, but T U V W X Y Z X V
> is better because it keeps all the points in sequence 'a' together.
>
>
A -> D
>
> 1 1 11
> 2 2 22
>3 3 3 3
>
> Can anyone advise me what this problem is called, or give me pointers
> as to a solution?
> I expect its a part of graph the
try registering on top coder.
they have problems categorised. you can find quite a few dynamic problems
there...
all the best
--
Chandrasekhar
Final Year CSE
NIT Allahabad
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
