Description
Given a graph
- Each node stands for a building
- Node 0 stands for a video source (e.g., a Netflix server)
- Each edge stands for a possible connection
- Each edge is specified by its latency and bandwidth
Task
- We wants the network to be a spanning tree
- Find the minimum-possible latency from the video source to each building
- Find the maximum-possible bandwidth from the video source to each building
Input
Output
