What is the fine-grained topic of the following text: For the graph used in Adleman's paper (shown above), the Hamiltonian Path Problem would ask: can you find a path along the directed edges that travels from node 1 (green) to node 5 (red) and visits each node on the graph exactly once? Only return the topic.
Hamiltonian Path Problem in Adleman's Graph Theory Paper