You're viewing a comment by giogio and its responses.

giogio Permalink
February 10, 2009, 15:43

please someone answer the follow question

how can i prove that we can create a minimum spanning tree with Prim,Kruskals algorithms in the case that the weight of a tree w(T) is the largest (maximum) of the weights of the edges e

w(T)=max{w(e)}

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Type the word "server_84": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.