Person **A** It requires him to determine if a particular graph or not **G = (V, E)** have a **Hamiltonian road** from the vertex **a** vertex **second**.

Your colleague person **second** You have implemented a function that takes a non-directed graph. **G = (V, E)** and returns true if G has a **Hamiltonian cycle**. Person **second** said you can use my function to get your answer, just be sure to add a border that connects **a** with **second**.

Give an example that shows that the answer returned by Person **second**The function of & s may not match the person **A** The original problem

In other words, simply adding a border between **a** Y **second** It is insufficient to reduce the decision problem from HP to HC.