Re: n edges shortest path

the problem is not a hamiltonian path one.
You can go through a vertice as many times you want, and you are not
obliged to use all the vertices.
The only requirement is to go from point a to point b, using n arc

.