What is the fastes Algorithm for this distance problem ? (Thirsty Person)

Question

i have a bunch of cities (orange) and streets (green) and the problem to solve is to know the worst point on the street where you can be where you have the maximum distance to A