Shortest simple path problem is in P, but Longest simple path problem is in NP. Explain why the greedy choice(on edge weights) is not suitable in the second case .
Ankit Sambyal BITS Pilani -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.