小编李祐齊*_*李祐齊的帖子

我想问是否有办法找到2个坐标之间准确的最短路径。如图所示，这2个坐标是（-33.889606，151.283306），（-33.889927，151.280497）。 黑色路径是理想路径，红色路径使用get_nearest_node。以下是代码：

import folium
import osmnx as ox
import networkx as nx

ox.config(use_cache=True, log_console=True)

G = ox.graph_from_point((-33.889606, 151.283306), dist=3000, network_type='drive')

G = ox.speed.add_edge_speeds(G)
G = ox.speed.add_edge_travel_times(G)

orig = ox.get_nearest_node(G, (-33.889606, 151.283306))
dest = ox.get_nearest_node(G, (-33.889927, 151.280497))
route = nx.shortest_path(G, orig, dest, 'travel_time')

route_map = ox.plot_route_folium(G, route)
route_map.save('test.html')