Quiz: Counting Paths

Investigation: Count shortest paths from $1$ to all nodes. When relaxing edge $(u, v)$, you find dist[u] + w = dist[v]. What do you do with the path count?

1. A.Set count[v] = count[u]
2. B.Add count[u] to count[v]
3. C.Set count[v] = count[u] + 1
4. D.Do nothing, distance didn't improve