lolag2122
23.09.2019 •
Mathematics
List the first five multiples of 7?
Solved
Show answers
More tips
- C Computers and Internet Discovering the Differences Between iPad Wi-Fi and iPad 3G...
- F Food and Cooking What s the Best Rice for Cooking Plov?...
- F Family and Home How to Remove Fading from Clothes: Tips and Tricks...
- F Food and Cooking How to Make Polendwitsa at Home?...
- F Family and Home Parents or Environment: Who Has the Most Influence on a Child s Upbringing?...
- P Philosophy Unbelievable stories of encounters with otherworldly forces...
- L Leisure and Entertainment How to Choose the Perfect Gift for Men on February 23rd?...
- H Health and Medicine How to Treat Whooping Cough in Children?...
- H Health and Medicine Simple Ways to Lower Cholesterol in the Blood: Tips and Tricks...
- O Other How to Choose the Best Answer to Your Question on The Grand Question ?...
Answers on questions: Mathematics
- M Mathematics Agraph relates the amount of gas in the tank of your car to the distance you can drive. why does the graph stop?...
- M Mathematics Richard bought six pounds of sliced ham for $2.79 per pound. how much did he spend? $8.79 $16.74 $12.24 $16.24...
- E English 45 points need help asap finals deadline is tonight....
- H History Describe the four elements that markets need for success...
Ответ:
Ответ:
Check the explanation
Explanation:
Algorithm for solving flood condition:
We suggest an algorithm to resolve the flood condition by creating a flow network graph.
Let us assume for every patient "p" there is a node "2" and for every hospital "h" there is a node "uh" and there is an edge ()T, uh) exist between patient "p" and hospital "h" with flow capacity of 1 iff patient "p" is reachable to hospital "h" within a half-hour.
Then source node "s" is made between all the patient-nodes by an edge with flow capacity of 1 and then the sink "t" is made by linking all the hospital nodes by an edge with capacity "[n/k]".
There is an approach to send patients to hospitals: when there is a source "s" to sink "t" flow of "n". We can send 1 flow-unit from source "s" to sink "t" along the paths (s, yp, uh, t) whenever a probable approach is available to send patients.
This approach of sending patients to hospitals doesn't break the capacity limitation of edges. Hence we can send patient "p" to hospital "h" with 1 flow- unit if edge(m uh) permits at least 1 flow- unit.
The running-time of this algorithm is found by finding the time needed to solve max-flow graph with nodes O(n+k) and edges O() edges.