Long description

Figure a: It is a resource graph. Here a set of nodes are connected randomly as follows. The node R points left to the node A. The node A points down to node S. The node C also points right to node S. The node D points left to node S and right to node T. The node B points down to node T which points right to node E. The node E points down to node V which points down left to node G. The node G points up to node U which again points up to node D. The node W points up to node F which also points up to node S.

Figure b: A cycle extracted from figure a: The same previous connection of nodes D, T, E, V, G and U is shown here.

Note: Here the nodes A, B, D, F, G, C and E are given in circles, and the nodes R, S, U, W, V, and T are given squares.