duckroutingGraph routing for DuckDB

Shortest paths, cost matrices and service areas over any table of edges, powered by the Boost Graph Library.

pgRouting semantics

Signatures, column names and edge conventions follow pgRouting, and the test suite checks results against pgRouting's own published output.

Routing runs on boost::adjacency_list and boost::dijkstra_shortest_paths, so the algorithms are the same ones pgRouting builds on.

Point a function at a query returning id, source, target and cost. No topology tables to build, no geometry required.