Graph Algorithms SQL Tests

View source code

These tests cover the SQL graph-algorithm functions exposed through the packaged runtime.

Covered Behavior

1) shortestPath(...)

Asserts the result is a list and, when it is not empty, that it starts at A and ends at D. The hop count is not asserted, and an empty path passes.

2) dijkstra(...)

Verifies weighted path selection using the configured distance edge property.

3) astar(...)

Checks that A* returns the same weighted path shape on the same graph.

4) RID variable inputs

Confirms that dijkstra(...) accepts RID-valued sqlscript variables, matching the documented example style.

5) disconnected paths

Ensures disconnected shortestPath(...) queries do not produce a misleading multi-hop path.

Runtime Guard

The wheel always ships shortestPath, dijkstra, and astar; a missing one fails these tests.