Like in title. What is the optimal way to keep nodes in memory for Kruskal’s algorithm, and why?
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.
Like in title. What is the optimal way to keep nodes in memory for Kruskal’s algorithm, and why?
Kruskal algorithm is basically dong exactly what the Disjoint set forest structure is meant to do. This structure starts with all nodes being in separate components and then supports operations of the kind
and
That is exactly why I would tell this is the most suitable representation for the nodes.