Longest path problem
In graph theory, the longest path problem is a problem of finding the longest path in a graph. Unlike the shortest path problem, this problem is NP-complete which means that we can't find the optimal solution in polynomial time.
In graph theory, the longest path problem is a problem of finding the longest path in a graph. Unlike the shortest path problem, this problem is NP-complete which means that we can't find the optimal solution in polynomial time.