equal
deleted
inserted
replaced
|
1 |
1 /** |
2 /** |
2 @defgroup datas Data Structures |
3 @defgroup datas Data Structures |
3 This group describes the several graph structures implemented in HugoLib. |
4 This group describes the several graph structures implemented in HugoLib. |
4 */ |
5 */ |
5 |
6 |
14 fail to provide |
15 fail to provide |
15 some graph features like edge or node deletion. |
16 some graph features like edge or node deletion. |
16 |
17 |
17 Hugolib also offers special graphs that cannot be used alone but only |
18 Hugolib also offers special graphs that cannot be used alone but only |
18 in conjunction with other graph representation. The examples for this are |
19 in conjunction with other graph representation. The examples for this are |
19 \ref EdgeSet, \ref NodeSet, and the large variety of graph wrappers. |
20 \ref hugo::EdgeSet "EdgeSet", \ref hugo::NodeSet "NodeSet" |
|
21 and the large variety of \ref gwrappers "graph wrappers". |
20 |
22 |
21 You are free to use the graph structure that fit your requirements |
23 You are free to use the graph structure that fit your requirements |
22 the best, most graph algorithms and auxiliary data structures can be used |
24 the best, most graph algorithms and auxiliary data structures can be used |
23 with any graph structures. |
25 with any graph structures. |
24 */ |
26 */ |
79 /** |
81 /** |
80 @defgroup experimental Experimental Structures and Algorithms |
82 @defgroup experimental Experimental Structures and Algorithms |
81 This group contains some Experimental structures and algorithms. |
83 This group contains some Experimental structures and algorithms. |
82 The stuff here is subject to change. |
84 The stuff here is subject to change. |
83 */ |
85 */ |
84 |
|
85 /// \ingroup misc experimental |
|
86 namespace hugo { } |
|