edited by
11,029 views
44 votes
44 votes
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes ______.
edited by

5 Answers

Answer:

Related questions

36 votes
36 votes
4 answers
5
go_editor asked Feb 14, 2015
9,417 views
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
32 votes
32 votes
4 answers
8
go_editor asked Feb 14, 2015
9,242 views
Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...