Cheapest Flights Within K Stops

Given directed flights (from, to, price), find the cheapest price from src to dst with at most k stops. Print -1 if no route exists.

1 <= n <= 100 0 <= m <= n * (n - 1) / 2 0 <= k < n