author | alpar |
Fri, 19 Mar 2004 07:39:09 +0000 | |
changeset 202 | 0bd4fe53b1d0 |
child 204 | d8107ae24128 |
permissions | -rw-r--r-- |
alpar@202 | 1 |
/*! |
alpar@202 | 2 |
|
alpar@202 | 3 |
\page maps How to write maps |
alpar@202 | 4 |
|
alpar@202 | 5 |
\section read-maps Readable Maps |
alpar@202 | 6 |
|
alpar@202 | 7 |
It is quite easy to write your own readmap for the edges or nodes of a graph. |
alpar@202 | 8 |
|
alpar@202 | 9 |
You can find some example below. |
alpar@202 | 10 |
|
alpar@202 | 11 |
\code |
alpar@202 | 12 |
class MyMap |
alpar@202 | 13 |
{ |
alpar@202 | 14 |
double get(Graph::EdgeIt e) { return 1;} |
alpar@202 | 15 |
}; |
alpar@202 | 16 |
\endcode |
alpar@202 | 17 |
|
alpar@202 | 18 |
A more complex example |
alpar@202 | 19 |
|
alpar@202 | 20 |
\code |
alpar@202 | 21 |
class MyLengthMap |
alpar@202 | 22 |
{ |
alpar@202 | 23 |
const Graph::EdgeMap &ol; |
alpar@202 | 24 |
const Graph::NodeMap &pot; |
alpar@202 | 25 |
|
alpar@202 | 26 |
double get(Graph::EdgeIt e) const { return ol.get(e)-pot.get(v)-pot.get(u);} |
alpar@202 | 27 |
|
alpar@202 | 28 |
MyComplexMap(const Graph::EdgeMap &o,const Graph::NodeMap &p) : |
alpar@202 | 29 |
ol(o), pot(p); |
alpar@202 | 30 |
}; |
alpar@202 | 31 |
\endcode |
alpar@202 | 32 |
|
alpar@202 | 33 |
*/ |