Graph rewriting using a single pushout; a comparison

Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. Here we compare both approaches. We show that they are almost the same, the only difference being the way dangling arcs are treated.