Please suggest an algorithm for creating minimum diameter spanning tree from an undirected graph.
Thanks.