# Algorithm implementation in Sage

Input: Two undirected simple graphs G1 and G2, each having n vertices.
Output: `True`

if G1 ? = G2; `False`

otherwise.

```
for i ? 1,2 do
Ai ? adjacency matrix of Gi
pi ? permutation equivalence class of Ai
A0 i ? lexicographically maximal element of pi
if A0 1 = A0 2 then
return True
return False
```

anyone have any idea how to implement this in Sage ?