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

$ curl repovive.com/roadmaps/graph-theory/strongly-connected-components/coin-collector-implementation

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

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

$ curl repovive.com/roadmaps/graph-theory/strongly-connected-components/coin-collector-implementation

Repovive

Coin Collector - Implementation - Strongly Connected Components | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

Coin Collector - Implementation

(C++ code)

Here is the solution:

for i from 1 to numSCCs:
    dp[i] = compCoins[i]

for v in topoOrder:
    for u in compAdj[v]:
        dp[v] = max(dp[v], compCoins[v] + dp[u])

print max(dp[1..numSCCs])

Process in topological order to ensure dp[u] is computed before dp[v].

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