Dijkstra, bin_heap, fib_heap added to the doc.
3 \page maps How to write maps
5 \section read-maps Readable Maps
7 It is quite easy to write your own readmap for the edges or nodes of a graph.
9 You can find some example below.
11 This simple map assigns \f$\pi\f$ to each edge.
16 double operator[](Graph::EdgeIt e) const { return 1;}
21 Here is a more complex example. It provides a length function which is obtained
22 from a base length function modified by a potential difference.
23 \todo Please improve on the english.
28 const Graph::EdgeMap &ol;
29 const Graph::NodeMap &pot;
31 double operator[](Graph::EdgeIt e) const {
32 return ol.get(e)-pot.get(v)-pot.get(u);
35 MyComplexMap(const Graph::EdgeMap &o,const Graph::NodeMap &p) :