Answer Happy

Let G=(V,E) be a directed graph with negative-weight edges. Then one can compute shortest paths from a single source s E V to all v EV faster than Bellman-Ford by re-weighting the edges to be non-negative and then running Dijkstra's algorithm. True False The path between any two vertices s and t in the minimum spanning tree of a graph G must be a shortest path from s to t in G. True False Let P be the shortest path from some vertex s to some other vertex t in a graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. True False