Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true?
as all NPC are NPH and It's already mentioned undirected graph.See this.
@Abhisek Tiwari 4
yes, they mention longest path as NP-Hard, but shortest path they havenot mentioned