Hi, I feel confused with this computer networking problem, it’s like a type of Dijkstra Algorithm problem,
however, the constrains right here is the capacity of each links. Thus, it become something like maximum flow problem. But I’m not sure. Could you help me with this homework?
Thanks so much!