Traverse a weighted graph visiting all nodes with total weight being the minimum

Question

I want to be able to traverse a weighted and undirected graph visiting all of the nodes. This weight has to be the minimum possible path as well. I know it\'s Hamilton inspi