Is there any fast algorithm to check the isomorphism and find the mapping between two rooted undirected graphs by BFS? Since my two input graphs are rooted I am just assuming that BFS can find it out quicker if they are not isomorphic. Any help/clue is greatly appreciated. Thanks.