Sooooo cuteeeee

[shwetha]

I just attended a lecture of Algorithms and data structures . I have an extremely cute professor and watching him teach....ohhh wow ....he is the most adorable prof ive ever seen. He looks just like a teddy bear.He is a russian and his pronunciations are soooo cute and he is just tooo amazing. He says three ( for tree...) negathives, thu, thime

Comments

[mekin]

i wonder what you are studying ....
going by ur post .. u seem to study him more than the subject ;)

When

[sunmaster15]

the cat is in the way,the mice shall play...

Re: When

[shwetha]

in the way?? i thought the cat was away..

Re: When

[sunmaster15]

string.toUpper("cat") and u might see what i mean ;)

me a prof

[amitvirmani]

kaash mere baare mein bhi koi ladki aisa sochti.....
now i wanna be a prof.....chuck ms, chuck mgmt, teaching...here i come

[rileen]

I hope you also manage catch a bit of what to me is a beautiful subject :-)

[shwetha]

Seeing ur interest in algos I thgt mebbe u cud help me in this. Im trying to find an efficient algo to find all minimum spanning trees. Using Kruskals I end up with a cycle searching prolem which is NP hard (I believe)...See if u can throw some light on this...would really be a help

Details ?

[rileen]

Hey, not sure what exactly you mean ..... Kruskal's algo is for finding a minimum spanning tree of a connected graph, what are you doing with it?

It sounds like you are trying to solve an NP-hard problem - try a reduction, e.g if you can prove that every instance of the Hamiltonian cycle problem can be converted into an instance of your problem, you will have proved that your problem is NP-hard.

Does that make sense? Or are you not aware of reductions yet?

Re: Details ?

[shwetha]

No...I have to find all possible minimum spanning trees in a given graph. I am not sure its a NP hard problem. I think it is solvable.
Do u know any method to do this....
yeah i'll see if it does reduce to an NP hard prolem then fine...but I dont think so