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).
3 #include <lemon/maps.h>
10 ConstMap<int, char> a('#');
12 cout << "sizeof ConstMap<int,char> = " << sizeof a << endl;
13 cout << "a[5] = " << a[5] << endl;
15 StdMap<int, char> b('$');
16 cout << "sizeof ConstMap<int,char> = " << sizeof b << endl;
17 cout << "sizeof std::map<int,char> = "
18 << sizeof(std::map<int,char>) << endl;
19 cout << "b[5] = " << b[5] << endl;
22 cout << "b[5] = " << b[5] << endl;