The Student Room Group

OCR D1 June 2007 Q6 MST and lower bound cycle

Hello

I do not understand the answer to a part b. Constructing the MST using Prim on the matrix is ok. However, I do not understand the process for deleting the node B then finding a lower bound for the (Hamiltonian?) cycle by adding back the shortest paths from B. What algorithm is this? What has been created as a result of this step? How do I know it must be a lowest bound? I have looked at several textbooks and I cant find this process described maybe I missed it. I will appreciate any help in explaining this step .

Thanks.

Quick Reply

Latest