S-38.149 Postgraduate Course in Teletraffic Theory, Fall 2001

Homeworks by Yongzhao Yang
Deadline: 15 October

1) Part of Exercise 2.1 (page 99 of the textbook): 
   Consider the graph of Fig. 2.14 (on page 100). 
   Find a shortest path from 1 to all nodes using 
   a) the binary heap method 
   b) Dial's algorithm
2) Exercise 2.4 (page 100 of the textbook)
3) Exercise 2.5 (page 100 of the textbook)