I didn't see any code in the library that supports checking if two graphs are isomorphic. Graphs G and H are said to be isomorphic if there exists a bijection f: G -> H s.t. for all u in G, v in H, f(u) is adjacent to f(v) iff u is adjacent to v. I would like to add a function that tests if a given function forms an isomorphism between G and H, and a function that checks if two graphs could be isomorphic.
Description
I didn't see any code in the library that supports checking if two graphs are isomorphic. Graphs G and H are said to be isomorphic if there exists a bijection f: G -> H s.t. for all u in G, v in H, f(u) is adjacent to f(v) iff u is adjacent to v. I would like to add a function that tests if a given function forms an isomorphism between G and H, and a function that checks if two graphs could be isomorphic.