Single- destination shortest - paths problem:Find the shortest path to a given destination vertex t from every vertex v. By shift the direction of each edge in the graph, we can shorten this problem to a single - source problem. Single - pair shortest - path problem:Find the shortest path...