What is the 'Longest Path Problem' in graphs?

What is the 'Longest Path Problem' in graphs?

Approach: Discuss the complexity of finding the longest path between nodes.

The problem of finding a simple path of maximum length in a given graph. For general graphs, it is NP-hard. For Directed Acyclic Graphs (DAGs), it can be solved in linear time using dynamic programming.

Follow-up: How does it relate to the Hamiltonian path problem?

Key concepts: np-hard, hamiltonian path, dag.