For typical networks the amount of computation per node is significantly greater than the cost of the function call executed for every node. Pre computing Information . Pre computing information can drastically speed up execution . An additional advantage is that a slower, recursive, but simple to write and ensure correct, routine can be used for determining the neighbors in a SOM of arbitrary dimensionality Fault Finding . Dynamic memory errors may not be evident until much later in a program .
Commercial packages do an excellent job of finding array bounds and memory use problems .
Free variants . Z Summary . For correctness and maintainability . Use object oriented design to aid reuse of existing code . Use reverse algorithms to check original input is obtained .