6 /** |
6 /** |
7 @defgroup graphs Graph Structures |
7 @defgroup graphs Graph Structures |
8 @ingroup datas |
8 @ingroup datas |
9 \brief Graph structures implemented in Hugo. |
9 \brief Graph structures implemented in Hugo. |
10 |
10 |
11 Hugolib provides several data structures to meet the diversing requirements |
11 Hugolib provides several data structures to meet the diverging requirements |
12 of the possible users. |
12 of the possible users. |
13 In order to save on running time or on memory usage, some structures may |
13 In order to save on running time or on memory usage, some structures may |
14 fail to provide |
14 fail to provide |
15 some graph features like edge or node deletion. |
15 some graph features like edge or node deletion. |
16 |
16 |
17 Hugolib also offers special graphs that cannot be used alone but only |
17 Hugolib also offers special graphs that cannot be used alone but only |
18 in conjunktion with other graph representation. The examples for this are |
18 in conjunction with other graph representation. The examples for this are |
19 \ref EdgeSet, \ref NodeSet, and the large variety of graph wrappers. |
19 \ref EdgeSet, \ref NodeSet, and the large variety of graph wrappers. |
20 |
20 |
21 You are free to use the graph structure that fit your requirements |
21 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 |
22 the best, most graph algorithms and auxiliary data structures can be used |
23 with any graph structures. |
23 with any graph structures. |