判断题：Kruskal's minimum spanning tree algorithm implemented by disjoin

Kruskal's minimum spanning tree algorithm implemented by disjoint set with union-by-rank strategy has $O(|E| log⁡|E| )$ time complexity. Further optimization by introducing path compression improves it to $O(|E|α(|E|,|V|))$ where $α$ is the functional inverse of Ackermann's function.

答案：FALSE