Home/ Questions/Q 7549451
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-30T09:57:04+00:00

I have a symmetric 2d array myMSTdata[][] of points that represents a minimum spanning

  • 0

I have a symmetric 2d array “myMSTdata[][]” of points that represents a minimum spanning tree MST with values 0 if there is no edge or real value that represent the weights on the edges and now I need to partition this tree into two subtrees (part1,part2) where the the cutting criteria is the edge with the maximum weight. Then repeatedly keep partitioning the larger size subtree (which means the subtree with the greater number of nodes) till the remaining number of nodes in the larger size subtree is K.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Would suggest the use of Adjacency list for this kind of operations, since

    1. You need to seperate the vertices repeatedly
    2. The number of edges < $n$ the number of vertices.
    3. Large run time benefits.

    May I know the complexity you are looking at ?

    If you are happy with any complexity I would suggest repeated DFS, since you are working with a tree, a repeated DFS will cover all edge & vertices. The runtime will be about O(n^2) in the worst case.

    • 0