How do I describe an efficient algorithm to solve this problem? In a problem called the bottleneck problem, you are given a graph G with edge weights, two vertices s and t and a particular weight W; your goal is to find a path from s to t in which every edge has at least weight W.

Can someone explain in pseudocode how to solve this? I think we use BFS right??