Proposal: O(N^5) algorithm solving Graph Isomorphism problem (comparison of graphs)

With a high certainty, I guess this polynomial-time algorithm solves Graph Isomorphism problem in general case. In the absence of possibility to spend time on its proof or work in a team, I put the algorithm online so that you can see whether it works well for your scientific or production needs and