1.1 --- a/src/include/bin_heap.h Thu Apr 29 23:24:42 2004 +0000
1.2 +++ b/src/include/bin_heap.h Fri Apr 30 01:02:22 2004 +0000
1.3 @@ -61,7 +61,7 @@
1.4 #ifndef BIN_HEAP_HH
1.5 #define BIN_HEAP_HH
1.6
1.7 -///ingroup auxdat
1.8 +///\ingroup auxdat
1.9 ///\file
1.10 ///\brief Binary Heap implementation.
1.11
2.1 --- a/src/include/dijkstra.h Thu Apr 29 23:24:42 2004 +0000
2.2 +++ b/src/include/dijkstra.h Fri Apr 30 01:02:22 2004 +0000
2.3 @@ -2,7 +2,7 @@
2.4 #ifndef HUGO_DIJKSTRA_H
2.5 #define HUGO_DIJKSTRA_H
2.6
2.7 -///ingroup galgs
2.8 +///\ingroup galgs
2.9 ///\file
2.10 ///\brief Dijkstra algorithm.
2.11
3.1 --- a/src/include/error.h Thu Apr 29 23:24:42 2004 +0000
3.2 +++ b/src/include/error.h Fri Apr 30 01:02:22 2004 +0000
3.3 @@ -3,6 +3,7 @@
3.4 #ifndef HUGO_ERROR_H
3.5 #define HUGO_ERROR_H
3.6
3.7 +//! \ingroup misc
3.8 //! \file
3.9 //! \brief Basic error handling (signaling) routines.
3.10
4.1 --- a/src/include/fib_heap.h Thu Apr 29 23:24:42 2004 +0000
4.2 +++ b/src/include/fib_heap.h Fri Apr 30 01:02:22 2004 +0000
4.3 @@ -3,7 +3,7 @@
4.4 #ifndef HUGO_FIB_HEAP_H
4.5 #define HUGO_FIB_HEAP_H
4.6
4.7 -///ingroup auxdat
4.8 +///\ingroup auxdat
4.9 ///\file
4.10 ///\brief Fibonacci Heap implementation.
4.11
5.1 --- a/src/include/smart_graph.h Thu Apr 29 23:24:42 2004 +0000
5.2 +++ b/src/include/smart_graph.h Fri Apr 30 01:02:22 2004 +0000
5.3 @@ -3,7 +3,7 @@
5.4 #ifndef HUGO_SMART_GRAPH_H
5.5 #define HUGO_SMART_GRAPH_H
5.6
5.7 -///ingroup graphs
5.8 +///\ingroup graphs
5.9 ///\file
5.10 ///\brief SmartGraph and SymSmartGraph classes.
5.11
6.1 --- a/src/include/time_measure.h Thu Apr 29 23:24:42 2004 +0000
6.2 +++ b/src/include/time_measure.h Fri Apr 30 01:02:22 2004 +0000
6.3 @@ -2,7 +2,7 @@
6.4 #ifndef HUGO_TIME_MEASURE_H
6.5 #define HUGO_TIME_MEASURE_H
6.6
6.7 -///ingroup misc
6.8 +///\ingroup misc
6.9 ///\file
6.10 ///\brief Tools for measuring cpu usage
6.11
7.1 --- a/src/include/unionfind.h Thu Apr 29 23:24:42 2004 +0000
7.2 +++ b/src/include/unionfind.h Fri Apr 30 01:02:22 2004 +0000
7.3 @@ -2,7 +2,7 @@
7.4 #ifndef HUGO_UNION_FIND_H
7.5 #define HUGO_UNION_FIND_H
7.6
7.7 -//!ingroup auxdat
7.8 +//!\ingroup auxdat
7.9 //!\file
7.10 //!\brief Union-Find data structures.
7.11
8.1 --- a/src/include/xy.h Thu Apr 29 23:24:42 2004 +0000
8.2 +++ b/src/include/xy.h Fri Apr 30 01:02:22 2004 +0000
8.3 @@ -4,7 +4,7 @@
8.4
8.5 #include <iostream>
8.6
8.7 -///ingroup misc
8.8 +///\ingroup misc
8.9 ///\file
8.10 ///\brief A simple two dimensional vector and a bounding box implementation
8.11 ///
9.1 --- a/src/work/alpar/list_graph.h Thu Apr 29 23:24:42 2004 +0000
9.2 +++ b/src/work/alpar/list_graph.h Fri Apr 30 01:02:22 2004 +0000
9.3 @@ -3,7 +3,7 @@
9.4 #ifndef HUGO_LIST_GRAPH_H
9.5 #define HUGO_LIST_GRAPH_H
9.6
9.7 -///ingroup graphs
9.8 +///\ingroup graphs
9.9 ///\file
9.10 ///\brief ListGraph, SymListGraph, NodeSet and EdgeSet classes.
9.11
10.1 --- a/src/work/athos/minlengthpaths.h Thu Apr 29 23:24:42 2004 +0000
10.2 +++ b/src/work/athos/minlengthpaths.h Fri Apr 30 01:02:22 2004 +0000
10.3 @@ -2,7 +2,7 @@
10.4 #ifndef HUGO_MINLENGTHPATHS_H
10.5 #define HUGO_MINLENGTHPATHS_H
10.6
10.7 -///ingroup galgs
10.8 +///\ingroup galgs
10.9 ///\file
10.10 ///\brief An algorithm for finding k paths of minimal total length.
10.11
11.1 --- a/src/work/marci/graph_wrapper.h Thu Apr 29 23:24:42 2004 +0000
11.2 +++ b/src/work/marci/graph_wrapper.h Fri Apr 30 01:02:22 2004 +0000
11.3 @@ -2,7 +2,7 @@
11.4 #ifndef HUGO_GRAPH_WRAPPER_H
11.5 #define HUGO_GRAPH_WRAPPER_H
11.6
11.7 -///ingroup gwrappers
11.8 +///\ingroup gwrappers
11.9 ///\file
11.10 ///\brief Several graph wrappers.
11.11 ///