equal
deleted
inserted
replaced
38 the best, most graph algorithms and auxiliary data structures can be used |
38 the best, most graph algorithms and auxiliary data structures can be used |
39 with any graph structures. |
39 with any graph structures. |
40 */ |
40 */ |
41 |
41 |
42 /** |
42 /** |
|
43 @defgroup semi_adaptors Semi-Adaptors Classes for Graphs |
|
44 @ingroup graphs |
|
45 \brief Graph types between real graphs and graph adaptors. |
|
46 |
|
47 Graph types between real graphs and graph adaptors. These classes |
|
48 wrap graphs to give new functionality as the adaptors do it. But the |
|
49 other way they are not light-weigth structures as the adaptors. |
|
50 */ |
|
51 |
|
52 /** |
43 @defgroup maps Maps |
53 @defgroup maps Maps |
44 @ingroup datas |
54 @ingroup datas |
45 \brief Some special purpose map to make life easier. |
55 \brief Some special purpose map to make life easier. |
46 |
56 |
47 LEMON provides several special maps that e.g. combine |
57 LEMON provides several special maps that e.g. combine |
48 new maps from existing ones. |
58 new maps from existing ones. |
49 */ |
59 */ |
50 |
|
51 |
60 |
52 /** |
61 /** |
53 @defgroup graph_maps Graph Maps |
62 @defgroup graph_maps Graph Maps |
54 @ingroup maps |
63 @ingroup maps |
55 \brief Special Graph-Related Maps. |
64 \brief Special Graph-Related Maps. |