The fastest known algorithms for computing the diameter of an \(n\) -node, \(m\) -edge graph with nonnegative edge weights solve All-Pairs Shortest Paths (APSP) and
run in \(O(\min \lbrace mn+n^2\log \log n, n^3/exp(\sqrt{\log n})\rbrace )\)  time [1]}, [2]}. For unweighted graphs one can use fast matrix multiplication [3]}, [4]}, [5]} and solve the problem in \(O(n^{2.373})\)  time.
