I would pick one of the solutions from constructing a tree from csv file and then discard all but the shortest pathes.
In reply to Re: find shortest path for each query from a CSV file
by hdb
in thread find shortest path for each query from a CSV file
by zing
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |