申論題

13.(5%) If some of the edge weights in a graph are negative, the shortest path can be obtained using's algorithm by first adding a large constant C to each edge weight, where C is large every resulting edge weight will be nonnegative (True or False). _____The Bellman-Ford algorithm is not suitable if the input graph has negative-weight edges (True or False)._____