Shortest Paths
Below is a map of 7 cities (A - G). All these
cities are somehow connected to each other by roads. The table below gives
you the shortest paths between some of the cities using the drawn roads.
All roads have a different length between 1 and 10 kilometers. Can you
assign the lengths to the roads?
|
A
|
B
|
C
|
D
|
E
|
F
|
|
G
|
7
|
|
12
|
14
|
11
|
|
|
F
|
8
|
|
|
5
|
|
|
|
E
|
|
7
|
4
|
|
|
|
|
D
|
11
|
|
8
|
|
|
|
|
C
|
9
|
|
|
|
|
|
|
B
|
|
|
|
|
|
|