Check if graph is correct

[wires]

we want to make sure if two graphs described as edge lists are isomorphic.

1→2, 2→3, 1→3, 2→4 ≅ 4→6, 6→1, 4→1, 6→3

with datascript JS example we can test this, like this

edge(e1, 1, 2).
edge(e2, 2, 3).
edge(e3, 1, 3).
edge(e4, 2, 4).
isWhatIWant(N1,N2,N3,N4,E1,E2,E3,E4) :- edge(E1,N1,N2), edge(E2,N2,N3),
   edge(E3,N1,N3), edge(E4,N2,N4), N1 != N2 != N3 != N4, E1 != E2 != E3 != E4.

but that doesn't cover all cases.. or does it?

[wires]

wip on PR #23