- minor corrections on indentation, format, etc.

- updates methods and removes deprecated ones:
  > Lb computing and pruning, Ub computing
  > cycle equalized nodes (sampling without replacement)
  > adds stopping criteria (gap, %gap and no update)

- adds command line parameters for choosing root and projection/averaging (in tb2{main,types,wcsp}.cpp)

- (fixRoot) flag to choose whether to fix a same root value
- (shiftToC0) flag to choose whether to shift unary costs to c0 or average only
  with the equalizeNode method

- corrects cost-reset order in asc-pass
- corrects desc-pass
- adds unaryProjection to equalizeRoot() method

- works for 1-trees
- randomly chooses a root
- splits findBestAssignments in: ascending pass, equalizeRoot, descending pass and graph::findbestAssignment
- equalizeRoot finds root value bestV that minimizes the sum(t_in_trees) of cost_t_(v)
- forces this value in Ub computation and in each subgraph bestAssignment
- adds other methods to be used with projection

Problem while initializing costs.

Ub was not properly updated.

Now update only 2 trees: the most divergent and a random one.
Use SoPlex instead of lp_solve (but still commented).
When finding DAC supports, now favors values that have been selected by other trees.

Skip assigned variables and deconnected constraints.
Read new constraints (from variable elimination).

Moved DD-MRF after VAC, added LP check, added sum-product, etc.

Compile, works, but does not communicate with the WCSP.

Fix the issue of inconsistency between flow and DP for Regular() due to deltaCost may be unchanged in project()

Nettoyage de blancs.

nettoyage d'espaces

Nettoyage d'espace en prime.

Ajour de la fonction Exp.

is now required for toulbar2 compilation