{"id":30615571,"url":"https://github.com/torahappy/takasa","last_synced_at":"2026-04-30T20:33:16.972Z","repository":{"id":40965433,"uuid":"254321754","full_name":"torahappy/takasa","owner":"torahappy","description":"OpenStreetMap 高低差を考えた最短（？）経路問題ソルバー","archived":false,"fork":false,"pushed_at":"2023-07-06T21:58:40.000Z","size":42,"stargazers_count":1,"open_issues_count":2,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-04-11T18:06:49.191Z","etag":null,"topics":["numpy","openstreetmap","scipy","shortest-path"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/torahappy.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-09T09:01:54.000Z","updated_at":"2023-05-19T05:30:57.000Z","dependencies_parsed_at":"2024-12-28T11:35:03.058Z","dependency_job_id":null,"html_url":"https://github.com/torahappy/takasa","commit_stats":null,"previous_names":["torahappy/takasa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/torahappy/takasa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torahappy%2Ftakasa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torahappy%2Ftakasa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torahappy%2Ftakasa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torahappy%2Ftakasa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/torahappy","download_url":"https://codeload.github.com/torahappy/takasa/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torahappy%2Ftakasa/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32476682,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"ssl_error","status_checked_at":"2026-04-30T13:12:06.837Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["numpy","openstreetmap","scipy","shortest-path"],"created_at":"2025-08-30T08:05:44.453Z","updated_at":"2026-04-30T20:33:16.939Z","avatar_url":"https://github.com/torahappy.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# OpenStreetMap 高低差を考えた最短（？）経路問題ソルバー\n![takasa wo kangaeru](takasa.png)\n\nOpenStreetMapの地図データと国土地理院の標高データを組み合わせて、高低差が出来るだけ小さくなり、かつ経路も出来るだけ短くなるような経路をかんがえます。\n\n## 実行方法\n\nまず国土地理院のサイト\u003chttps://fgd.gsi.go.jp/download/menu.php\u003eにいき、探索範囲の「数値標高モデル」をダウンロードしましょう。（要会員登録）\n\nzipファイルを全て解凍し、ダウンロードした大量のxmlファイルを実行ディレクトリの`DL`下に配置します。\n\n次にPythonファイルを作成し、以下のように目的地などの情報を設定して、solve関数を呼びます。\n\n経路の探索は指定された緯度・経度からなる矩形の範囲内で行われます。緯度・経度は小数点表記で書いてください。\n\n```python\nimport solve\nimport elevation\nimport mapdata\n\npathbound_small = [探索範囲の最小緯度, 探索範囲の最小経度]\npathbound_large = [探索範囲の最大緯度, 探索範囲の最大経度]\n\npathstart_nodeid = 出発地のOpenStreetMap上のNode ID\npathend_nodeid = 目的地のOpenStreetMap上のNode ID\n\nmapdata.generate_mapdata(pathbound_small, pathbound_large)\nelevation.generate_elevation()\nsolve.solve(pathstart_nodeid, pathend_nodeid)\n```\n\nNode IDは\u003chttps://openstreetmap.org/\u003eなどで検索しましょう。右クリックで「地物を検索(Query Features)」すると付近の道が出現します。道のリンクをクリックすると、その道を構成するノードが現れます。\n\n実行後、経路のノードID一覧`nodeids.results`と、\n\nそれをOverpass APIが処理できるようにした`overpass_query.results`が生成されます。\u003chttps://overpass-turbo.eu/\u003eに入力すると、マップと照らし合わせることができます。\n\nまた、範囲内の標高データ・マップデータをPythonが扱いやすいように処理したファイルである`elevation.shel`と`mapdata`も生成されます。これらは範囲(`pathbound_small`と`pathbound_large`)が変わらない限り、使い回すことができます。\n\n## 仕様\n\nてきとうに考えました。\n\n1. scipyの`shortest_path`関数を使って解きます。\n1. 探索対象の道は`highway`パラメータの存在する全ての道です。つまりフェリーや電車の路線などでない、歩行者や自動車が通るような全ての道にマッチします。\n1. 一方通行などの区別はないです。つまり、`shortest_path`関数に渡す行列は対称行列です。\n1. 道の長さと高低差をスコア化し、そのスコアの合計値が最小になるような経路を選びます。スコアの計算方法にはさまざまなものを実装しておりますますので、スコアの詳細は`solve.py`の100行目あたりを読もう！\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftorahappy%2Ftakasa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftorahappy%2Ftakasa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftorahappy%2Ftakasa/lists"}