Alter Nodes

class alterNodes.mutate(parent)

This node does a bitflip mutation while creating new solutions

count()

This function calculates the number of nodes below it and including itself

evaluate(sets)

This function evaluates the node and returns the resulting set

fillTerms(sets, settings)

After the bbsa places all of the non-terminal nodes, this funciton is called to place the terminal nodes at the bottom of the parse tree

makeProg(numTab, var)

This function generates the code for this node for the external verification

randomize(sets, settings)

This function randomizes the parameters of the node if there are any

toDict()

This function is used to create a dictionary representaion of the bbsa

toString()

This function is used to create a string representaion of the bbsa

update(depth, sets, settings)

This function updates the heights and depths and ensures that the settings pointer is pointing to the right settings object