Traveling Policy of Ajobdesh

Here, to find the required the shortest distance from u to v, you will need the shortest distance from any u to C and then C to any v.

The later part can be precomputed by a single BFS from source C.

The first part might seem a little bit tricky, but it can also be done by a single BFS from source C in the reversed graph.