Fig. 1
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
a An example of two edge labeled Eulerian graphs \(G_1\) (top) and \(G_2\) (bottom). b The alignment graph \(\mathcal {A} (G_1,G_2)\). The cycle with red edges is the path corresponding to \(\textsc {GTED} (G_1, G_2)\). Red solid edges are matches with cost 0 and red dashed-line edge is mismatch with cost 1