How to find the diameter of a graph, which have only one cycle(N vertexes, N paths)?

Правка en1, от legendjohn9999, 2018-02-06 15:01:59

Hi All. Is there any LINEAR algorithm to find the diameter of a graph, which have only one cycle(N vertexes, N paths)?

Теги #graph, #diameter

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский legendjohn9999 2018-02-06 15:01:59 208 Initial revision (published)