PythonでPriority R-Treeを使って近傍の道路を超高速検索 - Qiita

import osmium import pickle import copy from tqdm import tqdm ONEWAY = 1 BIDIRECTIONAL = 0 def wayDirection(oneway): if oneway in [None, "no", "false", "0", "reversible"]: return BIDIRECTIONAL if oneway in ["reverse", "-1"]: return -ONEWAY else: return ONEWAY class DataHandler(osmium.SimpleHandler): def __init__(self): super().__init__() self.d = {} self.d["nodes"] = {} self.d["ways"] = {ONEWAY: {