Histogram for number of paths on an acyclic undirected graph.

Правка en2, от gitarist, 2019-09-02 22:48:02

Hello everyone. I need your help. I have been trying to solve a problem from code chef, and I wonder whether, it is possible to count number of paths with length i for all i in [1..n] on an acyclic undirected graph in O(n*log(n)) time complexity or not. Here, by length of a path I mean the number of nodes the path contains.

Теги #graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский gitarist 2019-09-02 22:48:02 1
en1 Английский gitarist 2019-09-02 22:45:35 432 Initial revision (published)