How to determine possible routes and distances

[JCI_JLA]

Hi

I have a problem that I have been trying to solve for quite a while. I know it can be done in Macros but I just lack the programing abilities to make it happen. I hope somebody out there can help me.

I have a the following list of point and distances in between

Beggining End Distance
A B 35
B C 160
C D 700
C E 240
C F 120
F G 35


this points are part of a network or grid (please see the attachement). The points or nodes in the network can be letters or numbers or a combination of both.

What I would like to determine is all the possible routes and distances within this network. Using only the table above.

The result should look like

A B 35
B C 160
C D 700
C E 240
C F 120
F G 35
A B C 195
B C D 860
B C E 400
B C F 280
C F G 155
A B C D 895
A B C E 435
A B C F 315
B C F G 315
A B C F G 350


This is fairly easy when there is few nodes but when the number is significant it turns into a nightmare.

Thank you very much in advance