[algogeeks] simple MST problm

Please give me an algorithm for this problem--- Show that if an edge(u,v)is contained in some MST, then it is a light edge crossing some cut of the graph. i need a solution very urgently... plz help.. --~--~-~--~~~---~--~~ You received this message because you

[algogeeks] Please help..Simple MST problem.

Can anyone please solve any of the following problems? I need a detailed solution. It is my data structure assignment, and i have to submit it by the 4th of april. Please someone help me... its urgent. Show that if an edge(u,v)is contained in some MST, then it is a light edge crossing some cut

[algogeeks] Re: simple MST problm

BAN 2009/3/28 saha.dipan...@gmail.com saha.dipan...@gmail.com Please give me an algorithm for this problem--- Show that if an edge(u,v)is contained in some MST, then it is a light edge crossing some cut of the graph. i need a solution very urgently... plz help..

[algogeeks] Re: simple MST problm

can u explain wat an light edge is? On Sat, Mar 28, 2009 at 3:00 AM, saha.dipan...@gmail.com saha.dipan...@gmail.com wrote: Please give me an algorithm for this problem--- Show that if an edge(u,v)is contained in some MST, then it is a light edge crossing some cut of the graph. i need a