Adress to n-Adress calculating

I need a distance-table for n-Locations. Making n*n calculations is
to time consuming. Is there a possibility to make a 1 to n - calculation
in one iteration (like Dijkstra) ?

:idea:

Can you explain you question a little more...

I try to solve TSP (travelling salesman problem) and VRP (vehicle routing problem). When solving a TSP I begin with some solution and in further steps I try to improve the solution. So In the beginning I need the the distances from 1 to 2, 2 to 3, ... , n-1 to n. When I try to improve the
solution then I make a lot of changes in the ordering of the nodes. So I need the distance from every node to every node. This is a n*n matrix.

When I try to do this with MP I only can commute a distance between two
nodes. So this is of time n*n.

In the net algorithm like dijkstra I only need n iterations because with one iteration I have the distances to all other nodes.

Interactively using MapPoint I don't see any way to do it. Are you a programmer or do you have an IT staff member who is?