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

Revision en1, by 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)?

Tags #graph, #diameter

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English legendjohn9999 2018-02-06 15:01:59 208 Initial revision (published)