Homework answers / question archive / Suppose that within navigation software each local place of interest is represented by a vertex in a weighted graph

Suppose that within navigation software each local place of interest is represented by a vertex in a weighted graph

Computer Science

Share With

Suppose that within navigation software each local place of interest is represented by a vertex in a weighted graph. 

If the user's goal is to find the fastest routes from a hotel to all of the local attractions, argue whether the minimum spanning tree or the shortest path algorithm is most appropriate to help solve the problem.