Implementation [of network cellular automata]

Given a network represented as a list in which element i is {a, i , b }, where a is the node reached by the above connection from node i, and b is the node reached by the below connection, each step corresponds to

NetCAStep[{rule_, net_}, list_] := Map[Replace[#, rule] &, list〚net〛]