I claim to have solved the travelling salesman problem as follows.
(You will have to be familiar with djikstra's algorithm for this.)
1) I am about to start using djikstra's algorithm on any given road network but,
2) The end node is not known for now, regardless, I just begin from any arbitrary node, assuming I will be given the end node at some later point in time or I will claim it myself.
3) At each step of djikstra's algorithm you stop me, I claim the last node I currently am to be the end node I was looking for. Also at each step I disregard the roads that has been travelled already for that particular path.
4)Whenever I get stopped, I am at the shortest path I can be from my initial node to the current node by virtue of djikstra's algorithm (end node from djikstra's perspective)
5) I continue the process unless I start to reach to every node.
6) There is only a final node remaining, I go there and still, the path I have chosen is shortest path possible from initial node to that node, and I have travelled all the nodes possible.
7) I return to the initial node, travelling through all the nodes with shortest path possible.
Question: why I haven't solved the travelling salesman problem?
P.S. please comment if my argument is not clear enough I will try to refine it. There is clearly a gap in my understanding of the theory and I want to understand what it is. I don't have enough CS experience to pose a question algorithmically.