Entirely rework cycle canceling algorithms (#180)

- Move the cycle canceling algorithms (CycleCanceling, CancelAndTighten)
into one class (CycleCanceling).
- Add a Method parameter to the run() function to be able to select
the used cycle canceling method.
- Use the new interface similarly to NetworkSimplex.
- Rework the implementations using an efficient internal structure
for handling the residual network.
This improvement made the codes much faster.
- Handle GEQ supply type (LEQ is not supported).
- Handle infinite upper bounds.
- Handle negative costs (for arcs of finite upper bound).
- Extend the documentation.

 #define LEMON_VERSION "@PROJECT_VERSION@"

 #cmakedefine LEMON_HAVE_LONG_LONG 1

 #cmakedefine LEMON_HAVE_LP 1

 #cmakedefine LEMON_HAVE_MIP 1

 #cmakedefine LEMON_HAVE_GLPK 1

 #cmakedefine LEMON_HAVE_CPLEX 1

 #cmakedefine LEMON_HAVE_CLP 1

 #cmakedefine LEMON_HAVE_CBC 1