Do I understand correctly when I say that your function is only capable of computing the shortest path between a root and all other nodes. I am looking for a function that efficiently computes shortest paths between all nodes in a subset of the nodes of the whole graph.
Do I understand your code correctly when I say the following:
- I would have to call the function multiple times (for each root). It is not possible to specify r as a vector of roots? In other words, this algorithm does not save any info when you have to compute path from multiple roots.
- All computation spent on shortest paths to nodes that I do not need is lost. Is this really necessary (i.e. inherent to the Bellman-Ford algorithm) or could this could become faster if it is adapted to the situation I need it for?
Thank you very much for your reply.
@none Thanks for your compliments.
I would be grateful if you would post or send me your results for these REAL problems.
For example, I have not been able to find the official optimum solutions to the problems. This makes me uneasy.
This file is not there because I did not have room for the larger files on my website. I pointed this out at the start of TestBFNOTMaps.m
All the USA files are available here: