Weakly connected tree

Posted by wow_22 on Stack Overflow See other posts from Stack Overflow or by wow_22
Published on 2011-02-06T23:20:10Z Indexed on 2011/02/06 23:25 UTC
Read the original article Hit count: 226

Filed under:

hello I have an algorithmic problem using a weakly connected tree T where w(T)=sum(w(e)) for each edge e,by w i declare weight and i have to prove that we can use prim and Kruskal algorithm while w(T)=max{w(e)} maximum between any edge e belongs at T (I proved that) but i have also to prove the same for w(T)=?(w(e)) while ? states product of all edges belongs at T i tried a lot to prove it but i did not came up with a result that proving or disapproving the use of prim ,kruskal
any help will be more than appreciated thanks

© Stack Overflow or respective owner

Related posts about tree