# This direct graph contains 16 nodes linked by 33 wighted arcs. Each row corresponds to an arc width its weight. The entries in each row are the source, the destination and the weight of the arc, respectively. # For example the first row "1 2 1" corresponds to the directed arc from node number "1" to node number "2", the wight of this arc is the last entry "1". # Find the length of the shortest path from the node 1 to the node 16 1 2 1 1 5 3 2 3 2 2 5 1 3 4 3 3 7 5 4 8 2 5 6 3 5 9 2 5 10 1 6 2 6 6 10 1 7 2 2 7 6 1 7 8 1 7 10 1 8 3 1 9 13 4 9 14 5 10 9 2 10 14 1 11 7 3 11 10 2 11 12 2 12 7 2 12 8 3 12 16 1 14 13 2 14 15 1 15 10 5 15 11 2 16 11 3 16 15 2