Wrong description in Kruskal's algorithm of Graph explore card

In this explore card of "Graph", section "Algorithms to construct minimum spanning tree"
https://leetcode.com/explore/learn/card/graph/621/algorithms-to-construct-minimum-spanning-tree/3856/

It says "... choose exactly N-1 edges of the graph with N edges in total...", it should be "... choose exactly N-1 edges of the graph with N nodes in total..."
See screenshot below.
image

Comments (0)