Skip to main content
. 2015 Sep 17;32(1):17–24. doi: 10.1093/bioinformatics/btv548

Fig. 1.

Fig. 1.

Walks in bidirected graphs. (a) A valid walk enters and exits a node through opposite edge-orientations. (b) An invalid walk enters and exits a node through identical edge-orientations. (c) Reversing all edge-orientations adjacent to a node results in the same valid and invalid walks