I intuitively feel that if one is using Prim’s algorithm to find a graph’s minimum spanning tree, it doesn’t matter which root node is picked – the resultant MST will have the same weight regardless. Is this correct?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I intuitively feel that if one is using Prim’s algorithm to find a graph’s minimum spanning tree, it doesn’t matter which root node is picked – the resultant MST will have the same weight regardless. Is this correct?
That is correct. Choosing a different starting node could give you a different spanning tree, but it will always have the same weight: the minimal possible.