TODO program needs to be changed to run with the new definition of treedecomposition

TODO testing of the computation

Todo introduce bag computation

Now returns the time it took to solve the problem and can look at the memory usage for the
GPU implementations

Implemented the out of order introduce for dominating set
TODO not yet tested

implemented the mthods needed for a path decomposition and the join node
TODO is make it so vertices can be introcudes 'out of order'

Still need to make it so that if the introduces are not done in order, the algorithm still works

The order inside a bag is based on the ID of
the node. When a new node is added to the tree
decomposition in the introduce bag. The values of
of the different subsets will be changed in
such a way that the ordering of these values
is equivalent to the ordering of the ids.
This way there can be no problems with the join
bag where the nodes were inserted in different
orderings, leading to a mismatch when combining
the two children of the join bag.

The sequential algorithm has already been changed to work on
tree decomposition but the join bag was not implemented correctly.
There needs to be a way to make sure the order of the subset
notation is the same for both children of the join node.

Added the classes necessary for maximum
independent set on a nice graph decomposition.
Next I will try to change the algorithm in such
a way that it can handle graph decompositions
by implementing join nodes.

Added a simple graph to the program which can be used
to test the implementations of the algorithms.
The way this simple graph is implemented will most likely
stay more or less the same. Although this instance is a path decomposition.