Reducing the Hamiltonian cycle to the travelling salesman problem and self loops

Question

If this is my adjacency matrix for the hamiltonian cycle:

Then a reduction algorithm to reduce this to a TSP problem is to introduce 1 anywhere an edge is missing