CYCLIST-Widest Path Problem

I wanted to know how to approach this problem.What property of graphs has to be used here?
One method which I thought was of doing a DFS to find all paths from s to t(doing this by marking the explored vertex as unexplored when returning from recursion) and from this finding the maximum of the smallest edge weight out of all s-t paths.Is this correct or is there something better?

//