Fig. 4
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Modified alignment graphs based on input types. a \(G_1\) has open Eulerian trails while \(G_2\) has closed Eulerian trails. b Both \(G_1\) and \(G_2\) have closed Eulerian trails. c Both \(G_1\) and \(G_2\) have open Eulerian trails. Solid red and blue nodes are the source and sink nodes of the graphs with open Eulerian trails. “s” and “t” are the added source and sink nodes. Colored edges are added alignment edges directing from and to source and sink nodes, respectively