Wow, 10008 bytes... more than twice my previous Java solution.

Probably will add some figures later for explanation (especially the edge.twin.next.twin == edge.prev.twin.prev).

^ which is the last bug I fixed.

@HyperNeutrino Unrelated, but why do you "reimplement" union and intersection which is probably slower than the builtin version? For multiset? Try it online!

transform should be transpose ?

@HyperNeutrino Why would you need to sort an adjacency matrix?

existing += [sorted(transpose(a)) for a in permutations(transpose(adjacency(n)))]

(I renamed as ^^^)

BTW I suggest limit line length. Not everybody has wide monitor like you (assuming you have).

And even if they does, they may want to split the screen width to multiple windows.

(I'm talking about some of the long list comprehension)

@HyperNeutrino if _i not in [i]...

Why not if _i != i?

@user202729 probably asleep coding

@HyperNeutrino chat.stackexchange.com/transcript/message/41613997#41613997

@user202729 I reimplemented them because Proton's union and intersection operators (I'm assuming you're talking about | and &) are broken. Again, a necessary fix because it's breaking one of the few things that lets Proton outgolf Python, but that's for a later time. For my Python solution I really should fix that. I thought sorting the adjacency matrix and taking all vertical permutations of it would let me check for isomorphisms but I don't think it works. I don't get _i not in [i] eithe

r

(1 char too long D:)

@HyperNeutrino Funny.

What did you mean by "I don't get ... "? That doesn't work in Proton too?

Let's see... It's not the first time you get the logic wrong.

sorry I mean "get" as in "understand" so like I don't know why that's a thing either

BTW are you upvoting multiple "One OEIS after another" answers of mine at the same time? Why?

no, I'm not. I'm also getting a bunch at a time too; I got 6 in a row yesterday

Oh ok.

but yeah now that I see that I think I was trying to be lazy and do something with copy-pasting but I didn't so now that I see it it's obvious how it's meant to be done :p

Ok.