Control.Search.Local.Tree

The internal data structure of the library.

Documentation

data LSTree nme

A rose tree, but not currently using an optimised data structure, just this little home built one. The accessor functions should be easy enough to understand.

Constructors

LSTree

Fields

treeNodeName :: nme

treeNodeChildren :: [LSTree nme]

Instances

Eq nme => Eq (LSTree nme)

Ord nme => Ord (LSTree nme)

Making a tree part of Ord and Eq, for ease of comparison later. Note that how the order is determined depends upon the implementation given for a solution.

mkTree :: (a -> [a]) -> a -> LSTree a

The construction function, as seen in the paper. Takes a neighbourhood function, that is, a function that takes a solution and perterbs it in some way, giving a selection of new solutions. It then requires a seed, and gives back an initial tree.