Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.

 EXTRA_DIST += \

 	demo/CMakeLists.txt \

 	demo/digraph.lgf

 if WANT_DEMO

 noinst_PROGRAMS += \

 	demo/arg_parser_demo \

 	demo/graph_to_eps_demo \

 	demo/lgf_demo

 endif WANT_DEMO

 demo_arg_parser_demo_SOURCES = demo/arg_parser_demo.cc

 demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc

 demo_lgf_demo_SOURCES = demo/lgf_demo.cc