|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Side-by-side demonstration of every Phase 1 boundary policy. More...
#include <iomanip>#include <iostream>#include <string>#include <ca-traits.H>#include <tpl_ca_storage.H>#include <tpl_ca_lattice.H>Go to the source code of this file.
Functions | |
| int | main () |
Side-by-side demonstration of every Phase 1 boundary policy.
Builds a 3x3 lattice whose cells encode i*10 + j (so each cell is uniquely identifiable), then evaluates at_safe(coord) over a 7x7 window centred on the lattice. The window includes a one-cell halo outside the lattice on every side, plus another one to make the resolution policy obvious. Each boundary class is rendered next to the others so the differences stand out at a glance.
Definition in file ca_boundary_policies_example.cc.
| int main | ( | void | ) |
Definition at line 95 of file ca_boundary_policies_example.cc.
References Aleph::blossom_maximum_cardinality_matching().