# Question About Minimum Spanning Tree

Discussion in 'C++' started by BigBaz, Nov 20, 2008.

1. ### BigBazGuest

Given a graph G and a minimum spanning tree T, suppose that we
decrease the weight of one of the edges that is not in T. Give an
algorithm that finds the minimum spanning tree in the modified graph.

BigBaz, Nov 20, 2008

2. ### GiffGuest

BigBaz wrote:

What is the question? And what is the c++-related question?

Giff, Nov 20, 2008

3. ### Juha NieminenGuest

BigBaz wrote:
> Given a graph G and a minimum spanning tree T, suppose that we
> decrease the weight of one of the edges that is not in T. Give an
> algorithm that finds the minimum spanning tree in the modified graph.

You are supposed to do your homework yourself, not ask others to do it
for you.

Juha Nieminen, Nov 20, 2008
4. ### BigBazGuest

On Nov 20, 9:53 am, red floyd <> wrote:
Yes, I will try to do it myself. But this algorithm is different from
the normal algorithm of finding mst, otherwise the question will just
ask me how to find a mst. So clearly there's some difference. Any help
would be appreciated.

Jeff_Schwab, is your algorithm efficient? Thanks!

> BigBaz wrote:
> > Given a graph G and a minimum spanning tree T, suppose that we
> > decrease the weight of one of the edges that is not in T. Give an
> > algorithm that finds the minimum spanning tree in the modified graph.

>

>
> A complete answer can be found here:
>
> http://www.parashift.com/c++-faq-lite/how-to-post.html#faq-5.2
>
> Hope that helps.

BigBaz, Nov 20, 2008
5. ### Erik WikstrÃ¶mGuest

On 2008-11-20 11:04, BigBaz wrote:
> Given a graph G and a minimum spanning tree T, suppose that we
> decrease the weight of one of the edges that is not in T. Give an
> algorithm that finds the minimum spanning tree in the modified graph.

T' = T