The program for finding one of the largest isomorphic parts (in which all vertices are connected) of 2 graphs.
Computational complexity: O(n!)