How navigine/indoor-routing-library works
Project type and purpose
• This is a C++ open-source library (“Indoor Routing Library”) providing graph-based routing algorithms (graph construction, connectivity checks, shortest-path).
• It is not a full-stack app or service but a reusable algorithmic library with unit tests.
File structure
• Top level:
• CMakeLists.txt / Makefile – build orchestration
• / – public headers (navigine/route_graph)
• src/ – implementation of graph, router, utilities
• geometry/ – (presumably helper geometry code or external submodule)
• tests/ – unit tests and test data
• Patterns: clear separation of API (include), implementation (src), and verification (tests).
• Build: CMake with optional JSON_CI integration.
README for additional insights
• Core features: graph building, connectivity (Kosaraju), shortest route (Dijkstra), multilevel support, start/end projection, route “events.”
• Example usage shows a simple procedural API: instantiate RouteGraph, add levels/vertices/edges, validate, then getPath.
Elements
• Clear labels: e.g., “Graph Builder,” “Validation Module,” “Pathfinding Module,” “Client Code,” “Tests”
• Core modules (green)
• Data structures (yellow)
• Tests (orange)
• Build system (gray)