A Question

Правка en1, от NeverSee, 2019-10-07 12:15:30

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский NeverSee 2019-10-07 12:19:25 14
en2 Английский NeverSee 2019-10-07 12:16:11 77
en1 Английский NeverSee 2019-10-07 12:15:30 277 Initial revision (published)