The MCTS: Microsoft Exchange Server 2010 certification validates your skills in supporting the maintenance and administration of the Exchange servers in an enterprise environment. Learn everything you need to know with this course.

Hi guys: I give the name on each vertax a,b,c,d,e,f,g,h. Can any one please tell me how to find a minimal spanning tree and compute its total weight on this diagram?

Thanks.

qq2.jpg

Thanks.

qq2.jpg

Tom

so now BA and BE

BE is the shortest arc with length 2.

so now AC and AD

AD is the shortest arc with length 1.

AC create loop or circuit so we cant use it.

am i doing right?

This article includes lots of Java code examples to help explain the workings.

http://algs4.cs.princeton.edu/43mst/

DG is the shortest arc with length 8

DF is the shortest arc with length 7

EF is the shortest arc with length 3

FH is the shortest arc with length 5

GH is the shortest arc with length 6

I THINK REST OF THEM CREATE CIRCUIT

You have a-b-e-f-d-a

d-g-h-f-d

etc

LOOPS

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.

It is often far better to learn from your own experimentation than to be given just the answer.