New heuristics for MCF algorithms (#340)
and some implementation improvements.

- A useful heuristic is added to NetworkSimplex to make the
initial pivots faster.
- A powerful global update heuristic is added to CostScaling
and the implementation is reworked with various improvements.
- Better relabeling in CostScaling to improve numerical stability
and make the code faster.
- A small improvement is made in CapacityScaling for better
delta computation.
- Add notes to the classes about the usage of vector<char> instead
of vector<bool> for efficiency reasons.

 @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