Any hint for this problem, please? So far the only thing I thought of is to compute shortest and longest path from s to s, if they are both 0 then return "possible". But I have no idea how to compute the min. number of flights, which in my opinion does not have to correspond with the number of flights of the shortest, resp. longest path.