Question

Hamilton circuit problem can have the following version/s as per the input graph:

(a) directed

(b) undirected

(c) both (a) and (b)

(d) none of the mentioned

This question was posed to me in an internship interview.

This interesting question is from Node-Cover Problem, Hamilton Circuit Problem in division Intractable Problems of Automata Theory

Answer 1

The correct option is (c) both (a) and (b)

The best I can explain: Hamilton circuit problem is a problem determining whether a Hamiltonian path(a path in an undirected or directed graph that visits each vertex exactly once) exists in a graph(directed or undirected).