@cairdcoinheringaahing Many, many notifications :P...

Graph isomorphism checking in Python, use naive algorithm in O(n! × n²), input as adjacency matrix.

(so short in comparison with Java)

Wow, O(n!n²)...

Or, O((n-1)!n³) :P

@NieDzejkob Really?

BTW,

		graph = graph[:]
		next = graph.pop()

seems increbly wasteful.

Why not just next = graph[-1]?

(it's not that wasteful because it's a shallow copy, anyway)

Actually I don't understand why copying is necessary at all.

(probably to be sure, because Python list are mutable)

^ sorry...

@HyperNeutrino In your code, are cycles ordered or not?

Progress: I fixed HyperNeutrino's Python solution, so it works for input = 0 - 4, gives result 1, 1, 1, 2, 5 respectively. Currently I'm running it with input 5, hopefully it will gives 14.

Oh no... it returns 13.

Log file: here

@user202729 I was working with the assumption that hypers solution worked