title: How do I find the diameter of a graph?
body: <p>hey i'm looking for an algorithm to find the diameter (the longest shortest path) in an undirected unweighted graph G=(V,E).</p>
  
  <p>the best solution i found was to run BFS |V| times, running time: O(|V|*(|v|+|E|)).
  can anybody think of a more efficient solution?
  even if it's only a bit more efficient i'd like to hear your ideas !</p>
  
  <p>thanks a lot :)</p>