Test different ways to walk throug composite data structures

Compositum on Wikipedia Fig 1 Compositum Class.

• simple();
  • Connected Objects, recursive yield Enumeration
• counter();
  • Compositum // Array Counter, NO Recursion!
  • Every recursion can be replaced by Iteration Derived from: Böhm-Jacopini theorem
• linqy();
  • Cartesian // Using Build in functions of Linq to build cartesian Product
  • Further information
    • Iteration of Multidimensional Algorithms
    • Computing a Cartesian Product with Linq
• complex();
  • OR as well as AND Connected Composites
  • Combining the Cartesian and the recursive walk through the composite Fig 2 Experiment Tree Visualized.