title: Floyd Warshall algorithm with maximum steps allowed
body: <p>Is it possible to modify Floyd-Warshall algorithm when solving the shortest path problem for a directed weighted graph with <em>n</em> nodes, such that each shortest path have no more than <em>m</em> steps? More precisely, for each pair of nodes <em>i</em> and <em>j</em>, you are about to find the shortest directed path from <em>i</em> to <em>j</em> that contains no more than <em>m</em> nodes. Does time complexity still remain <em>O</em>(<em>n</em><sup>3</sup>)?</p>