|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Phase-6 illustration: a triangular lattice CA with up/down parity-aware neighbours. More...
#include <cstdio>#include <tpl_ca_engine.H>#include <tpl_ca_neighborhood.H>#include <tpl_ca_rule.H>#include <tpl_ca_storage.H>#include <tpl_ca_triangular_lattice.H>Go to the source code of this file.
Functions | |
| int | main () |
Phase-6 illustration: a triangular lattice CA with up/down parity-aware neighbours.
Drives a small (8x8) triangular lattice with a "spread once" totalistic rule: a cell becomes alive if it has at least one alive edge-neighbour, and stays alive thereafter. The example prints ASCII snapshots and dumps a TikZ render of the final frame.
Definition in file ca_triangular_example.cc.
| int main | ( | void | ) |
Definition at line 93 of file ca_triangular_example.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::print(), Aleph::CA::render_triangular_lattice_tikz(), seed, and Aleph::CA::Synchronous_Engine< Lattice, Rule, Neighborhood, Order >::step().