Let PTH = { < G, s, t, m > |G is a directed graph without...

 

Transcribed Image Text:

Let PTH = {< G, s, t, m > |G is a directed graph without any %3D cycle and there is a path in G from s to t with length at least m }. Is PTH in P, or NP? Prove your claim. Let PTH = {< G, s, t, m > |G is a directed graph without any %3D cycle and there is a path in G from s to t with length at least m }. Is PTH in P, or NP? Prove your claim.

Answer rating: 100% (QA)

Solution So Lets first understand complexity class There is two types of complexity classes 1 Time complexity It computes how long computation of a pr... View the full answer