Transitive closure and Floyd's algorithm

Правка en2, от sensei11, 2015-12-24 19:46:38

I was solving https://community.topcoder.com/stat?c=problem_statement&pm=12692&rd=15698.

Editorial : apps.topcoder.com/wiki/display/tc/SRM+586

I could follow the editorial till the section on "Transitivity". I don't understand how using Floyd's algorithm ensures that all constraints are satisified and what exactly is Transitive Closure. I looked up the term in graph theory though I don't see how it applies in this scenario.

Any help regarding the above matter would be appreciated.

Теги graphs, topcoder, floyd warshall

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский sensei11 2015-12-24 19:46:38 6
en1 Английский sensei11 2015-12-24 19:45:31 538 Initial revision (published)