approximations to shortest paths in undirected, unweighted graphs are discussed.
View Document Edit History