We are given an undirected and unweighted graph.
- We have to determine if the graph contains a path that visits every vertex exactly once