equal
deleted
inserted
replaced
7 The readable maps are very frequently used as the input of the |
7 The readable maps are very frequently used as the input of the |
8 algorithms. For this purpose the most straightforward is to use the |
8 algorithms. For this purpose the most straightforward is to use the |
9 maps provided by Hugo's graph structres. Very often however, it is more |
9 maps provided by Hugo's graph structres. Very often however, it is more |
10 convenient and/or more efficient to write your own readable map. |
10 convenient and/or more efficient to write your own readable map. |
11 |
11 |
12 You can find some example below. |
12 You can find some examples below. |
13 |
13 |
14 This simple map assigns \f$\pi\f$ to each edge. |
14 This simple map assigns \f$\pi\f$ to each edge. |
15 |
15 |
16 \code |
16 \code |
17 struct MyMap |
17 struct MyMap |