Figure 2From: Algorithms for effective querying of compound graph-based pathway databasesExample compound graph. An example compound graph (V (G) = {n1, n2, n3, n4, n5, c1}, E(G) = {n2c1, n3n2, n3n5, n4n1}, and I = {c1n4, c1n5}). The order, in which nodes are traversed, depends on the relationship between a compound structure and its members and on the relationship between members of a compound structure.Back to article page