I have one question that have a weighted directed graph with n vertex and m edge the goal is find the minimum walk from two vertex v & u with lengh k.
n <= 200 & m <= n * (n — 1) / 2 & k <= 1e9