Skip to content
Playing around with graphs created via parsing OpenStreetMap data
Rust Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github/ISSUE_TEMPLATE
examples
resources/maps
scripts
src
tests
.gitattributes
.gitignore
.travis.yml
CODE_OF_CONDUCT.md
CONTRIBUTING.md
Cargo.toml
LICENSE
README.md

README.md

osmgraphing

Build Status Crates.io Docs License

Goal of this student project is parsing openstreetmap data to calculate traffic routes on it.

News

The automatic deployment to crates.io is working. The parser has been finished and can parse Germany in ±8 minutes on a common machine.

Next step will be trying to find potential bottlenecks in street-networks. The idea is to calculate some routes via selfish routing (e.g. fastest path), resulting in routes and theoretical costs. With these selfish-routes, actual route-costs are calculated. These actual costs could be very different to the theoretical costs, since selfish routing leads to bad coverage of the streetgraph. The goal is to reduce the actual costs by removing edges from the streetgraph using the number of routes per edge.

Documentation and info follows. :)

Setup and usage

Please refer to setup and usage to get details about the project setup and how to run the code.

You can’t perform that action at this time.