help here? The assumption here is the "point" here would be a node in the graph (i. e. intersection of roads in the OSMNx graph) and you could find all the other reachable nodes under a cutoff distance. If this needs to be an arbitrary point on the map, then maybe one way could be to find the nearest node first?
An example:
```
import networkx as nx
import osmnx as ox
distances, _ = nx.single_source_dijkstra(G, 53057697, weight='length', cutoff=1200)
# The following subgraph will give you all the other nodes in the graph which are reachable within the cutoff distance 1200
G.subgraph(distances.keys())
# Plot the subgraph to look at "isodistance" neighbourhood.
ox.plot_graph(G.subgraph(distances.keys()))
```