Support negative costs and bounds in NetworkSimplex (#270)

* The interface is reworked to support negative costs and bounds.
- ProblemType and problemType() are renamed to
SupplyType and supplyType(), see also #234.
- ProblemType type is introduced similarly to the LP interface.
- 'bool run()' is replaced by 'ProblemType run()' to handle
unbounded problem instances, as well.
- Add INF public member constant similarly to the LP interface.
* Remove capacityMap() and boundMaps(), see also #266.
* Update the problem definition in the MCF module.
* Remove the usage of Circulation (and adaptors) for checking feasibility.
Check feasibility by examining the artifical arcs instead (after solving
the problem).
* Additional check for unbounded negative cycles found during the
algorithm (it is possible now, since negative costs are allowed).
* Fix in the constructor (the value types needn't be integer any more),
see also #254.
* Improve and extend the doc.
* Rework the test file and add test cases for negative costs and bounds.

@nodes

label

0

1

2

3

4

5

6

7

@arcs

		label capacity

0 	1 	0  	  16

0 	2 	1 	  12

0 	3 	2 	  20

1 	2 	3 	  10

1 	4 	4 	  10

1 	5 	5 	  13

2 	3 	6 	  10

2 	4 	7 	  8

2 	6 	8 	  8

5 	3 	9 	  20

3 	6 	10 	  25

4 	7 	11 	  15

5 	7 	12 	  15

6 	7 	13 	  18

@attributes

source 0

target 7