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.
1.True
2.False
