I am fairly new to Mathematica. I currently have a large weighted undirected graph representing a road network and I have a number of locations that I want to find the shortest paths between. There are currently two options with the FindShortestPath function; vertex a to b or vertex a to ALL.
Is there away to find the shortest path from a to a, c, d, e and f all in one instead of running the query each time for every shortest path.
I also am trying to find a way to table the GraphDistance for each shortest path.
I have a large graph with 1000s of vertices so scrolling through the GraphDistanceMatrix is a nightmare.