Minimum Bounding Box (loop) for a 2d point

Question

I have a planar graph, that represents a generic city topology. I need to find the smallest loop (set of crossroads) that contains a 2d point P (building). Is there any known al