Skip to main content
. 2009 Aug;16(8):1101–1116. doi: 10.1089/cmb.2009.0047

FIG. 2.

FIG. 2

(A) This is an example of a bidirected graph. By convention, we draw edges that are positive(negative) incident to a vertex using an out(in) arrow at that vertex. The sequence W, A, X, B, Y, C, Y, B, X, D, Z is a walk, while W, A, X, D, Z is not. (B) The corresponding edge incidence matrix, with the zero entries ommited. (C) This is the associated monotonized directed graph.