{"id":48908749,"url":"https://github.com/dilumaluthge/lightosm.jl","last_synced_at":"2026-04-16T22:03:58.932Z","repository":{"id":37828231,"uuid":"295607204","full_name":"DilumAluthge/LightOSM.jl","owner":"DilumAluthge","description":"A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.","archived":false,"fork":false,"pushed_at":"2026-04-10T00:01:06.000Z","size":4516,"stargazers_count":52,"open_issues_count":32,"forks_count":19,"subscribers_count":3,"default_branch":"master","last_synced_at":"2026-04-10T02:11:57.020Z","etag":null,"topics":["astar","dijkstra","geospatial","julia","kdtree","nominatim","openstreetmap","overpass","rtree"],"latest_commit_sha":null,"homepage":"https://aluthge.com/LightOSM.jl/","language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DilumAluthge.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2020-09-15T03:44:30.000Z","updated_at":"2026-04-09T23:58:19.000Z","dependencies_parsed_at":"2025-02-16T23:23:17.362Z","dependency_job_id":"fee3f1bb-ff1d-4fb8-9761-681e57623f93","html_url":"https://github.com/DilumAluthge/LightOSM.jl","commit_stats":null,"previous_names":["deloittedigitalapac/lightosm.jl","dilumaluthge/lightosm.jl"],"tags_count":34,"template":false,"template_full_name":null,"purl":"pkg:github/DilumAluthge/LightOSM.jl","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DilumAluthge%2FLightOSM.jl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DilumAluthge%2FLightOSM.jl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DilumAluthge%2FLightOSM.jl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DilumAluthge%2FLightOSM.jl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DilumAluthge","download_url":"https://codeload.github.com/DilumAluthge/LightOSM.jl/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DilumAluthge%2FLightOSM.jl/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31905896,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"ssl_error","status_checked_at":"2026-04-16T18:21:47.142Z","response_time":69,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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":["astar","dijkstra","geospatial","julia","kdtree","nominatim","openstreetmap","overpass","rtree"],"created_at":"2026-04-16T22:03:44.032Z","updated_at":"2026-04-16T22:03:58.897Z","avatar_url":"https://github.com/DilumAluthge.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LightOSM.jl\n\n[![Stable](https://img.shields.io/badge/docs-stable-blue.svg)](https://deloitteoptimalreality.github.io/LightOSM.jl/docs/)\n[![Tutorial](https://img.shields.io/badge/docs-tutorial-informational.svg)](https://deloitteoptimalreality.github.io/LightOSM.jl/notebooks/tutorial)\n[![Build Status](https://github.com/DeloitteOptimalReality/LightOSM.jl/workflows/CI/badge.svg?branch=master)](https://github.com/DeloitteOptimalReality/LightOSM.jl/actions?query=workflow%3ACI+branch%3Amaster)\n[![Codecov](https://codecov.io/gh/DeloitteOptimalReality/LightOSM.jl/branch/master/graph/badge.svg)](https://codecov.io/gh/DeloitteOptimalReality/LightOSM.jl)\n\n\n**[`LightOSM.jl`](https://github.com/DeloitteOptimalReality/LightOSM.jl)** is **[Julia](https://julialang.org/)** package for downloading and analysing geospatial data from **[OpenStreetMap](https://wiki.openstreetmap.org/wiki/Main_Page)** APIs (**[Nominatim](https://nominatim.openstreetmap.org/ui/search.html)** and **[Overpass](https://overpass-api.de)**), such as nodes, ways, relations and building polygons.\n\n## Acknowledgements\n\n**[`LightOSM.jl`](https://github.com/DeloitteOptimalReality/LightOSM.jl)** is inspired by the Python package **[OSMnx](https://github.com/gboeing/osmnx)** for its interface and Overpass query logic. Graph analysis algorithms (connected components and shortest path) are based on **[LightGraphs.jl](https://github.com/JuliaGraphs/LightGraphs.jl)** implementation, but adapted to account for turn restrictions and improve runtime performance.\n\nAnother honourable mention goes to an existing Julia package **[OpenStreetMapX.jl](https://github.com/pszufe/OpenStreetMapX.jl)** as many learnings were taken to improve parsing of raw OpenStreetMap data.\n\n## Key Features\n\n- `Search`, `download` and `save` OpenSteetMap data in .osm, .xml or .json, using a place name, centroid point or bounding box\n- Parse OpenStreetMap `transport network` data such as motorway, cycleway or walkway\n- Parse OpenStreetMap `buildings` data into a format consistent with the **[GeoJSON](https://tools.ietf.org/html/rfc7946)** standard, allowing for visualisation with libraries such as **[deck.gl](https://github.com/visgl/deck.gl)**\n- Calculate `shortest path` between two nodes using the Dijkstra or A\\* algorithm (based on LightGraphs.jl, but adapted for better performance and use cases such as `turn resrictions`)\n- Find `nearest nodes` from a query point using a K-D Tree data structure (implemented using **[NearestNeighbors.jl](https://github.com/KristofferC/NearestNeighbors.jl)**)\n\n## Documentation\n\nDocumentation for the API can be found **[here](https://deloitteoptimalreality.github.io/LightOSM.jl/docs)**.\n\n## Usage\n\nA comprehensive tutorial can be found found **[here](https://deloitteoptimalreality.github.io/LightOSM.jl/notebooks/tutorial)**.\n\n## Benchmarks\n\nBenchmark comparison for shortest path algorithms can be found **[here](https://deloitteoptimalreality.github.io/LightOSM.jl/notebooks/benchmarks)**.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdilumaluthge%2Flightosm.jl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdilumaluthge%2Flightosm.jl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdilumaluthge%2Flightosm.jl/lists"}