[-] q3
by eial - Tuesday, 12 May 2009 20:08:28
if I decide to show that both the number of edges are max and the tree is mst, can I saying that algorithm is based on kruskal, thus the tree is mst?
Re: q3
by algo092 - Sunday, 17 May 2009 13:43:21
As said before - you're asking about your proof. It is not possible to answer your qurstion without understanding everything you've done.