Not able to understand the tutorial for Codeforces Round #111 (Div. 2) Probelm-D. Edges in MST

Правка en3, от SSRaNa, 2022-03-31 15:39:55

Problem link: here. I could not able to understand the tutorial fully.

Could anyone explain in an intuitive way. Thanks

Теги codeforces, minimum spanning tree, dfs, graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский SSRaNa 2022-03-31 15:39:55 2 Tiny change: 'problem/D)\nI could ' -> 'problem/D). \nI could '
en2 Английский SSRaNa 2022-03-31 15:39:36 39
en1 Английский SSRaNa 2022-03-31 15:38:30 227 Initial revision (published)