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

$ curl repovive.com/roadmaps/graph-theory/strongly-connected-components/planets-and-kingdoms-implementation

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

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

$ curl repovive.com/roadmaps/graph-theory/strongly-connected-components/planets-and-kingdoms-implementation

Repovive

Planets and Kingdoms - Implementation - Strongly Connected Components | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

Planets and Kingdoms - Implementation

(C++ code)

After running Kosaraju or Tarjan:

numKingdoms = 0
for v from 1 to n:
    numKingdoms = max(numKingdoms, scc[v])

print numKingdoms
for v from 1 to n:
    print scc[v]

Make sure your SCC IDs are numbered from $1$ to $k$ , not $0$ to $k - 1$ . Some SCC algorithms use $0$ -based indexing, so add $1$ if needed.

This runs in $O(V + E)$ time and uses $O(V)$ space.