Diameter of a Psuedotree
Difference between en1 and en2, changed 9 character(s)
I know how to find the diameter of a tree in linear time, prove the validity of the algorithm used to do so (successive BFS's), and prove why it doesn't work for non-tree connected graphs.↵
↵
However, I need an algorithm/approach that has better complexity than O(N^2) to find the diameter of a relatively large WEIGHTED pseudotree (a tree with one extra edge).↵
↵
Please help, and thanks in advance!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English vamaddur 2017-07-15 22:51:28 9 Tiny change: 'ely large pseudotre' -> 'ely large WEIGHTED pseudotre'
en1 English vamaddur 2017-07-15 19:57:00 415 Initial revision (published)