CSES 1202 Investigation - Update Rules

If dist[u] + w < dist[v]:

• Set dist[v] = dist[u] + w.
• Set cnt[v] = cnt[u].
• Set minEdges[v] = minEdges[u] + $1$.
• Set maxEdges[v] = maxEdges[u] + $1$.

If dist[u] + w == dist[v]:

• Add cnt[u] to cnt[v] (mod $10^9 + 7$).
• Update minEdges[v] = min(minEdges[v], minEdges[u] + $1$).
• Update maxEdges[v] = max(maxEdges[v], maxEdges[u] + $1$).

The first case replaces the old path. The second case adds an alternative shortest path.