Graph and UndirGraph concept modifications.

* For incidence iterators ({In,Out,Inc}EdgeIt) there is now baseNode and
runningNode functions in graph interface
* For Edge in undir graphs: Edge(UndirGraph const &, UndirEdge, Node)
constructor. Same for IncEdgeIt
* Edge(UndirEdge, bool) constructor is no more in the public interface. (But we
need it in the developpers interface).

 c LEMON max flow problem

 p max 7 9

 n 1 s

 n 7 t

 a 1 2 3

 a 1 3 2

 a 1 4 1

 a 2 5 3

 a 3 5 2

 a 3 7 5

 a 3 6 3

 a 4 6 1

 a 5 7 2

 a 6 7 4