- Saving lives in a natural disaster Due tolarge scale natural disaster in a region, paramedics haveidentified a set of n injured people, P1,P2,… Pn, distributed across the region whoneed to be rushed to hospitals. There are k hospitals in theregion, H1, H2,… Hk, and eachperson needs to be taken to a hospital within 30 minutes traveltime to the hospital. You know the travel time for each person toeach hospital. Some people will have a choice of hospitals to goto. You want to work out whether or not there is asolution where each hospital receives at mostén/kù people.
- Determine a flow graph that represents this problem. That isspecify its vertices and edge
Types of vertices:and with what they represent
Types of edges along with what they represent and theircapacity
- explain how the max flow algorithm solves this problem. That ishow does the result of running the algorithm give us informationabout whether or not the problem is solved and what we candetermine from the flows on the graph.
java
