Graph edit distance is usually used for graph similarity checking due to its low information loss and flexibility advantages. However, graph edit distance can’t be used efficiently because it is an NP-Hard problem. Many graph edit distance heuristic algorithms have been proposed to solve this problem. However, some heuristic algorithms for generating \(walk\) generate unnecessary sequences because of the tottering, which leads to many problems. Because of this, various problems arise, like a decrease in approximation accuracy and an increase in execution time. In this paper, we propose an accurate and efficient graph edit distance heuristic algorithm that prevents tottering when generating \(walk\) . When generating \(walk\) , the traversed node‘s information is saved into the queue and then proceeds to traverse the next node. Then, it is possible to prevent the tottering by comparing an existing traversed node with an enqueued one. Through this, we propose a new \(walk\) generation algorithm that prevents generating unnecessary \(walk\) and applies it to existing algorithms to prevent the tottering.
