The widest path problem has a number of applications in many domains, including networking, shipping, and emergency response. Assuming the relationships between nodes in a graph are weighted by a capacity of some sort, the widest path problem involves finding the path between two nodes that maximizes the minimum capacity in the path.
Below, each node is a router in a city and the relationships between the routers have a bandwidth
property indicating the bandwidth capacity of the two routers' connection. The direction of the connection is arbitrary.