x Turn on thread page Beta
 You are Here: Home >< Maths

# Can someone explain this?? D1 watch

1. Hello, can someone explain how to do this, and what the thinking behind it is please?

https://i.gyazo.com/4127fc03a6a2930e...e78c8df57e.png

I am really not understanding this chapter at the moment, I don't know how to show that there are 4 spanning trees or whatever at all, and the example doesn't help whatsoever.

Thank you.
2. (Original post by iMacJack)
Hello, can someone explain how to do this, and what the thinking behind it is please?

https://i.gyazo.com/4127fc03a6a2930e...e78c8df57e.png

I am really not understanding this chapter at the moment, I don't know how to show that there are 4 spanning trees or whatever at all, and the example doesn't help whatsoever.

Thank you.
You join the nodes with the smallest distance/weight between them but you must not do a loop.

So you could do AtoD then BtoC, then CtoA BUT now you can't use the CtoD because you would have a loop. Then you'd do EtoF , CtoE Finished. Every node can be got to.

The next time round swap the CtoA route for CtoD but keep the rest of the tree the same.

There are alternative routes in other parts of the tree.

I hope this explanation is good enough.

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: November 12, 2015
Today on TSR

### Did he block me?

What should I do?

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams