3 ms·
If you have an edge list like: A->B A->D B->C C->D Postgres will walk both paths from A to D in the recursive CTE and then you can filter them afterwards t
by ellisv 4y ago
If you have an edge list like:
A->B
A->D
B->C
C->D
Postgres will walk both paths from A to D in the recursive CTE and then you can filter them afterwards to keep only the shortest.
You can use aggregate functions within the recursive CTE, so you can’t GROUP BY your starting node and stop once you find the first path. There isn’t a way to compare across multiple paths or iterations of the for-loop.
- FleaFlicker99 4y agoOk but that's a little different than saying you can't cut the traversal short. If I'm traversing ancestors (let's say) until I find one that doesn't satisfy a condition, it'll bail out then. I get that this doesn't serve all uses cases, but it isn't a small thing either.