Find path with maximum cost difference of edges in directed graph in linear-time

Question

Having a directed graph G with edges having positive weights, we define the cost of a path the difference between the edge with minimum weight and maximum weigh