dijstra: many to many, stop on first found

[cvvergara]

whole graph G = MG U SG is subdivided by main graph MG=(ME, MV) secundary graph SG=(SE, SV)

where ME intersection SE = empty MV intersection SV = {vertices in common} NOT empty

Find the shortest path from sv in SV (blue dots to an mv IN MV (yellow dots)

But instead of getting the many to many answer, stop on the first one found

[cvvergara]

https://docs.pgrouting.org/dev/en/pgr_dijkstraNear.html