úÎ)Ü     NoneModify the label of a treeCGet the neighbors of a label in a fast, theoretically efficient wayÿAssign clumps to the label list. Takes an old label and reassigns it to the new label in the labelmap, but looks at all neighbors defined by the distanceMap and the neighborDistance. If the reassigned nodes have already been reassigned (in the propertyList), then ignore.AAssign random labels to the leaves of a tree in a clumped fashion,Assign random labels to the leaves of a treeReturn the empty propertyMapReturn the propertyMapNoneC         NonesRun the monad transformer for the generation of a random tree. The minChildren value, if chosen, results in a leaf'The recursion for each step of the tree@The check for the lower bound: if not fulfilled, returns Nothing@Recursion which continues to make trees until the bounds are metReturn String trees       rando_JAI6zAWZ0qZGKZnS0T5T4vMath.RandomTree.LabelMath.RandomTree.TypesMath.RandomTree.Algorithms modifyLabel getNeighborsclumpItassignRandomClumpedPropertiesassignRandomPropertiesemptyPropertyMapgetPropertyMapReaderStateRandomrunReaderStateRandom TreeConfigmaxSizeminSize minChildren maxChildren TreeStatesize$fAlternativeReaderStateRandomrunTree treeRecursioncheckLowerBoundgetTreemakeTree