If P = NP then the Shortest-Path (finding the shortest path betw

If P = NP then the Shortest-Path (finding the shortest path between a pair of given vertices in a given graph) problem is NP-complete.~@[](5)

答案：TRUE