#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/disjoint-set-union-dsu/counting-components

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/disjoint-set-union-dsu/counting-components

Repovive

Counting Components - Disjoint Set Union (DSU) | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

Counting Components

Application 2

Problem: Count the number of connected components (Provinces). With DSU, this is direct.

Start with $N$ components (each node is its own component). Every time a union succeeds (returns true), you have merged two components into one. Decrement the count.

count := N
for each edge (u, v)
    if union(u, v) then
        count := count - 1
return count

The final count is your number of connected components. This pattern appears constantly: initialize count, decrement on successful unions. No need for extra traversals.