User interface widgets form a forest - windows contain layouts that contain widgets which also can be layouts, etc, etc. To implement Brown's algorithm to opti

User interface widgets form a forest - windows contain layouts that contain widgets which also can be layouts, etc, etc. To implement Brown's algorithm to optimize class-based language models I had to implement a complex forest (DAG, actually) in Python using lists of fixed length. That was not especially nice to work with.