A very efficient method for determing whether two graphs (of the same format) are isomorphic.
i1 : R = QQ[a..e]; |
i2 : areIsomorphic(cycle R, graph {a*c, c*e, e*b, b*d, d*a}) o2 = true |
i3 : areIsomorphic(cycle R, completeGraph R) o3 = false |
i4 : cycle R == "Dhc" o4 = true |
The object areIsomorphic is a method function.