{version = 1.06; (* of dirgra.p 1995 March 28} (* begin module describe.dirgra *) (* name dirgra: directed graph Monte Carlo analysis synopsis dirgra(dirgrap, list: in, output: out) files dirgrap: Parameters to control the program first line: number of iterations to perform second line: numbers of the first and the last node in the net. later lines: each line contains two numbers that define the graph links. list: analysis of the graph output: messages to the user description Do a Monte Carlo flow analysis of a directed graph examples The following dirgrap defines Figure 1 of Adleman1994: 60000 number of iterations to perform 0 6 numbers of the first and last nodes 0 3 0 1 0 6 1 2 1 3 2 3 2 1 3 2 3 4 4 1 4 5 5 1 5 2 5 6 and gives this list file as a result: dirgra 1.06 * first node: 0 * last node: 6 * Nodes: * 0 to: 3, 1, 6 * 1 to: 2, 3 * 2 to: 3, 1 * 3 to: 2, 4 * 4 to: 1, 5 * 5 to: 1, 2, 6 * Nodes with traversal counts and percentages: for 1811570 steps * 0 to: 3 (19981, 1%), 1 (19932, 1%), 6 (20087, 1%) * 1 to: 2 (212247, 12%), 3 (212948, 12%) * 2 to: 3 (244654, 14%), 1 (245891, 14%) * 3 to: 2 (238613, 13%), 4 (238970, 13%) * 4 to: 1 (119693, 7%), 5 (119277, 7%) * 5 to: 1 (39679, 2%), 2 (39685, 2%), 6 (39913, 2%) documentation @article{Adleman1994, author = "L. M. Adleman", title = "Molecular Computation of Solutions to Combinatorial Problems", journal = "Science", volume = "266", pages = "1021-1024", year = "1994"} see also author Thomas Dana Schneider bugs technical notes maxnodes and maxlinks are constants that define the maximum number of nodes and links the program can handle. The program records nodes and links in an array for speed. The non-standard random(0) function is used to generate random numbers. It is expected to give pseudo random numbers in the range 0 to 1. *) (* end module describe.dirgra *) {This manual page was created by makman 1.44}{created by htmlink 1.55}