Post by: Yendall on October 14, 2012, 10:35:02 pm
The answer here is C:
I understand why that is, because they started from a vertex and found the lowest weight (as a guideline, not a rule)
However, A also equals 19 with different weightings. This is how I saw it:
(http://i292.photobucket.com/albums/mm37/yendall_2008/networksquestion2_zpsfbc67b09.jpg)
It's fair to say that you should begin from the left and move to the right, but there isn't any real rule when deciding the minimal spanning tree, as long as it's the smallest weight? How can you justify one method as better than the other if you can determine the minimal spanning tree multiple ways? They are assuming that I started from the left and had to pick the smallest weight, however i could've started from the other side and decided 5 + 6 = 11 and 7 + 3 = 10, therefore I chose 7 as the lightest option? And even if that was the case and I have to account for the edge weighted "1", they would still equal 11?
How do I avoid this? How can you determine a correct answer?
Post by: brenden on October 14, 2012, 11:01:27 pm
Post by: Yendall on October 14, 2012, 11:02:37 pm