Is there an algorithm to compute the shortest Hamiltonian path in an undirected graph from one point to another in polynomial time?
The case you are describing is NP-complete, so the answer is no. 

I don't know if still remains NP-complete if the graph is a Euclidean graph. Anyone knows?