(10 pts) You are given a strongly connected directed graph G = (V, E) with positive edge weights along with a particular node vo E V. Describe an O...

Describe an O ((n + m) lg n) time algorithm for finding shortest paths between all pairs of nodes, with the one restriction that these paths must all pass through v0

1. (10 pts) You are given a strongly connected directed graph G = (V, E) with positiveedge weights along with a particular node vo E V. Describe an O ((n + m) lg n) timealgorithm for finding shortest paths between all pairs of nodes, with the onerestriction that these paths must all pass through vo.