edited by
5,106 views
26 votes
26 votes

A complete, undirected, weighted graph $G$ is given on the vertex $\{0, 1,\dots, n -1\}$ for any fixed ‘n’. Draw the minimum spanning tree of $G$ if

  1. the weight of the edge $(u, v)$ is $\mid u-v\mid$

  2. the weight of the edge $(u, v)$ is $u + v$

edited by

1 Answer

Best answer
46 votes
46 votes

$\text{(A)}$

$\text{(B)}$

edited by

Related questions

12 votes
12 votes
4 answers
4
makhdoom ghaya asked Nov 30, 2016
2,655 views
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.