Drag nodes to rearrange. Select a mapping to highlight isomorphism.
Select a graph and click "Find Isomorphism"
Two graphs are isomorphic if there exists a bijection between their vertex sets that preserves edge structure. The backtracking search uses degree sequences as a pruning heuristic.