A Hamiltonian path in a directed or undirected graph is a path that visits
1
every vertex of the graph exactly once.
2
every edge of the graph exactly once.
3
every vertex of the graph at least once.
4
every edge of the graph at least once.
5
Question Not Attempted