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.. > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
