If G is a weighted, undirected, connected graph with n nodes containing a negative weight cycle, then for every two nodes s, t, the shortest path from s to t containing at most n + 1 edges is strictly shorter than the shortest path from s to t containing at most n edges. (Note that here we allow a path to have duplicate nodes and edges.)

True or False and briefly justify.

Answer rating: 100% (QA)

FALSE If the graph contains a negativeweight cycle then ... View the full answer