
Hamiltonian cycle in polynomial time
I recently published paper which claims p=np by solving hamiltonian cycle in polynomial time.
I have already tested code for n=50 and it gives answer in 1 second . I still don't understand why people are not believing in spite of code is showing answer in 1 second. Please run the below java code on your machine and you can verify its polynomial time only.
https://github.com/sanketkulpnp-source/hamiltonian-cycle
This repo contains java code and sample file of 50 vertices. Readme file has all the instructions given. Please check it and verify its time complexity is polynomial time.