Research Article
Hidden Geometry of Bidirectional Grid-Constrained Stochastic Processes
Algorithm 1
Bidirectional Grid Constrained (BGC) stochastic processes.
(1) | # Pseudocode based on R. | (2) | INPUT: | (3) | | (4) | OUTPUT: | (5) | | (6) | | (6) | | (8) | | (9) | | (10) | | (11) | for do | (12) | | (13) | for do | (14) | if (t 1) then | (15) | | (16) | | (17) | else | (18) | | (19) | | (20) | | (21) | | (22) | | (23) | | (24) | | (25) | | (26) | if then | (27) | | (28) | else | (29) | | (30) | end if | (31) | end if | (32) | end for | (33) | if (Print_SimulationsTRUE) then | (34) | | (35) | else | (36) | | (37) | end if | (38) | | (39) | end for |
|