Floyd–Warshall Problem [Help]

Правка en1, от ThomazL, 2017-05-29 03:31:10

Hi everyone, recently tried to solve this problem. In the forum, a guy says to settle with Floyd-Warshall, but I do not know how to do that '-'

Can anyone explain me how to solve this problem used Floyd-Warshall algorithm?

Problem in a nutshell: You have a graph (N <= 100) and M querys. Each query asks about the minimum distance between two vertices using a maximum K steps.

Теги graph, floyd-warshall, help, uri

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ThomazL 2017-05-29 03:31:10 477 Initial revision (published)