Fig. 7
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
a An example of converting three vertical edges followed by one horizontal edge (blue line) to one horizontal edge followed by three vertical edges (red line). It can be done by doing boundary operations on 2-simplices labeled from 0 to 5. b An example of a cycle path (red line) and its auxiliary trail (blue line)