I am currently working with the pgr_withPointsCost() function in order to get the shortest path costs for millions of origin-destination pairs of Points (OD-Pairs; Many-To-Many). I got the function to work but I was wondering what happens to OD-Pairs pgrouting cannot find a path for?
The documentation of the function states the following:
"When the starting vertex and ending vertex are the different and there is no path. The agg_cost in the non included values (u, v) is ∞"
From this I see that OD-Pairs with no path found (which is eg. due to network connectivity problems) are not included in the result table.
Does pgrouting feature any option to include OD-Pairs that have no shortest path between the origin and destination point (eg by including them with an agg_cost value of NULL or ∞)?
I would like to see which pairs could not be connected by a shortest path in order to identify graph connectivity issues. I already thought about getting the result by using joins on OD-id pairs and the result table but was wondering if there was any pgrouting specific solution I have overseen.