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’ve implemented Prim’s algorithm to find the minimum-weight spanning tree of my graph, and it works fine.
Now I’d like to select the “best” head in the spanning tree. By “best” I mean the more balanced head, should I display the tree in a treeView UI for instance. I’m sure there are plenty of algorithms for that, but I don’t know how to name the problem !
One criteria you can use is the average distance from node to all the other nodes. Choose the node with minimum average distance. You can also probably try average square distance etc.