<jupyter_start><jupyter_text>plot_graph_routePlot a route along a graph.<jupyter_code># OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks
import osmnx as ox

ox.config(use_cache=True, log_console=False)
ox.__version__
query = '회현동, 중구, 서울특별시, 대한민국'
network_type = 'drive' # "all_private", "all", "bike", "drive", "drive_service", "walk"

# Create graph from OSM within the boundaries of some geocodable place(s).
G = ox.graph_from_place(query, network_type=network_type)

# Set origin and destination node ID
orig = list(G)[0]
dest = list(G)[-1]
# Solve shortest path from origin node(s) to destination node(s).
route = ox.distance.shortest_path(G, orig, dest)

# Plot a route along a graph.
ox.plot.plot_graph_route(
    G, 
    route, 
    route_color='r', 
    route_linewidth=4, 
    route_alpha=0.5, 
    orig_dest_size=100, 
    ax=None)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.113882863340564, 'fraction_numerical': 0.008676789587852495, 'mean_word_length': 5.112582781456954, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '305001', 'license': 'MIT', 'n_tokens_mistral': 348, 'n_tokens_neox': 351, 'n_words': 89, 'path': 'osmnx/plot/plot_graph_route.ipynb', 'repo_name': 'w3labkr/ipynb-gis', 'size': '922'}