Shortest distance from multiple points to one point
This is quite straightforward 


Reverse the direction of each edge.
Apply single source shortest path algorithm with destination as the source.
Reverse the direction again. (Optional, only if you want to preserve the originality of graph)


Time Complexity-
With graph given as adjacency list, it takes $O(E+V)$ to reverse the directions of each edge. With graph given as adjacency matrix, it takes $\theta(V^2)$. Rest you can apply any single source shortest path algorithm like Dijkshtra.

Note that a graph with reverse edges of original one typically called as transpose of the original graph.