I have a table with 2 columns: column A with the startvertex and column B with endvertex.
How can I do a OD pairs shortest path?
It is with a loop I suppose, but how can this loop be implemented into pgr_Dijkstra? It's impossible do to all the OD pairs manually, so an iteration is necessary.
I have already a working query for pgr_Dijkstra for a single point-to-point, but the problem is to do it for all the OD-pairs one-by-one.