Let G=(V,E) be a directed graph where each edge e in E has capacity
c(e) > 0.  The capacity of a path P is the minimum capacity over the
edges in P.  

Let s be a node in the graph and assume there is at least one path
from s to each node in V.  Design an efficient algorithm to find
a maximum capacity path from s to each node in V.