1distances from start vertex:
2distance(0) = 0
3distance(1) = 6
4distance(2) = 1
5distance(3) = 4
6distance(4) = 5
7
8shortest paths tree
90 --> 2
101 -->
112 --> 3
123 --> 4
134 --> 1
14