In the bottleneck-path problem, you are given a graphG with edge weights, two verticess and t and a particular weightW; your goal is to find a path froms to t in which every edge has atleast weight W.
(a) Describe an efficient algorithm to solve this problem.
(b) What is the running time of your algorithm.
Expert Answer
An answer will be send to you shortly. . . . .