Number of rooted trees in an undirected graph

Правка en1, от vatsal, 2016-11-22 18:22:44

What algorithm should I use to find the number of rooted trees in an undirected graph? This problem requires it.

Теги trees, graph, dsu, dfs and similar

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский vatsal 2016-11-22 18:31:00 1 Tiny change: 'equires it.](codeforc' -> 'equires it](codeforc'
en2 Английский vatsal 2016-11-22 18:29:41 1 Tiny change: 'ires it.](acodeforces' -> 'ires it.](codeforces'
en1 Английский vatsal 2016-11-22 18:22:44 202 Initial revision (published)