Travelling Salesman Problem

I have found a solution. By modeling the problem as a graph represented with an adjacency matrix, I can find the optimum path with only elementary row reduction and matrix multiplication. I will be keeping my discovery proprietary for now to continue searching for bugs, but please sing my praises and congratulate me on this world-changing discovery.

N is going to be the number of nodes...
I'm still a little skeptical that op has the algorithm, but i don't think it'd be impossible