Answering questions for minimum spanning tree problems, Operation Research

Sample Assignment for minimum spanning tree problems

For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

2317_Minimal_Spanning_Tree_EM.png

Answer

 

C = {A}                                  C' = {B, C, D, E, F, G}

C = {A, D}                             C' = {B, C, E, F, G}

C = {A, D, B}                                    C' = {C, E, F, G}

C = {A, D, B, C}                    C' = {E, F, G}

C = {A, D, B, C, G}               C' = {E, F}

C = {A, D, B, C, G, F}          C' = {E}

C = {A, D, B, C, G, F, E}      C' = { }

 

The resulting network is

1091_Minimal_Spanning_Tree_EM1.png

 

Cost = 2 + 1 + 4 + 3 + 3 + 5 = 18 units

 

Posted Date: 7/8/2012 8:15:35 AM | Location : United States







Related Discussions:- Answering questions for minimum spanning tree problems, Assignment Help, Ask Question on Answering questions for minimum spanning tree problems, Get Answer, Expert's Help, Answering questions for minimum spanning tree problems Discussions

Write discussion on Answering questions for minimum spanning tree problems
Your posts are moderated
Related Questions
Profitable Casino Corp. (PCC) is a Harrah's wannabe, intent on mimicking Harrah's analytical marketing techniques.  For example, PCC issues virtually all gamers a PCC "Rewards" car

Characteristics a. Discrete Distribution: Like  binomial  distribution it is  also a  discrete probability  i e,  occurrences can be  described  by a random  variable. b.

one example

advantage of quality circle process

b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape

Preparation of visual Aids ,Handouts and Feedback Forms It is   always  better to prepare  visual  aids much  in advance of the presentation. Leaving  them for the  last mo

main components of linear programming

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.