Question

which is the longest and shortest path.​

Answer 1

Ans=In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete.

I hope its helpful to you. ❣