OpenStreetMap-data and own graph-files are parsed and routing-algorithms compute shortest paths. Further, a graph (or the underlying network) can be optimized by computing a new metric, that reduces the workload of rush-hour-scenarios.

Rust library containing algorithms to shrink and dilate various geometric shapes.

Measure Kafka Consumer Offset Lag and Time Lag

2D offsetting for arc polylines

Assert struct layouts, including field sizes and offsets.