POJ 1861 Network Kruskal optimization template

Topic Links:

1861

Test instructions

and M-point n edges to make up two endpoints of the maximum and all sides of the smallest spanning tree

Bare minimum spanning tree plus two optimizations

1. Path compression: When looking for the X element's root node D, all the father nodes of X are directly transformed into the child nodes of the root node

To reduce the lookup time of the next lookup

2. Consider two nodes in the process of and check the number of child nodes, and less as child nodes

Code:

POJ 1861 Network Kruskal optimization template