It uses a queue D of discovered treelets, and a data-structure C that associate a treelet to those of its subtreelets that have been already computed.
we considered it was good enough for our purpose, since we mainly want to test our algorithm is a practical way.