1.1 --- a/doc/Doxyfile	Wed Apr 28 09:59:23 2004 +0000
     1.2 +++ b/doc/Doxyfile	Wed Apr 28 12:22:34 2004 +0000
     1.3 @@ -133,7 +133,7 @@
     1.4  # If set to NO, the detailed description appears after the member 
     1.5  # documentation.
     1.6  
     1.7 -DETAILS_AT_TOP         = NO
     1.8 +DETAILS_AT_TOP         = YES
     1.9  
    1.10  # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented 
    1.11  # member inherits the documentation from any documented member that it 
    1.12 @@ -167,7 +167,7 @@
    1.13  # For instance, some of the names that are used will be different. The list 
    1.14  # of all members will be omitted, etc.
    1.15  
    1.16 -OPTIMIZE_OUTPUT_FOR_C  = YES
    1.17 +OPTIMIZE_OUTPUT_FOR_C  = NO
    1.18  
    1.19  # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources 
    1.20  # only. Doxygen will then generate output that is more tailored for Java. 

     2.1 --- a/src/include/dijkstra.h	Wed Apr 28 09:59:23 2004 +0000
     2.2 +++ b/src/include/dijkstra.h	Wed Apr 28 12:22:34 2004 +0000
     2.3 @@ -36,7 +36,8 @@
     2.4    ///\param Heap The heap type used by the %Dijkstra
     2.5    ///algorithm. The default
     2.6    ///is using \ref BinHeap "binary heap".
     2.7 -  
     2.8 +  ///
     2.9 +  ///\author Jacint Szabo
    2.10  #ifdef DOXYGEN
    2.11    template <typename Graph,
    2.12  	    typename LengthMap,

     3.1 --- a/src/include/smart_graph.h	Wed Apr 28 09:59:23 2004 +0000
     3.2 +++ b/src/include/smart_graph.h	Wed Apr 28 12:22:34 2004 +0000
     3.3 @@ -28,6 +28,7 @@
     3.4    ///\sa \ref GraphSkeleton.
     3.5    ///
     3.6    ///\todo Some member functions could be \c static.
     3.7 +  ///\author Alpar Juttner
     3.8    class SmartGraph {
     3.9  
    3.10      struct NodeT 

     4.1 --- a/src/work/athos/minlengthpaths.h	Wed Apr 28 09:59:23 2004 +0000
     4.2 +++ b/src/work/athos/minlengthpaths.h	Wed Apr 28 12:22:34 2004 +0000
     4.3 @@ -25,7 +25,8 @@
     4.4    /// an algorithm which finds k edge-disjoint paths
     4.5    /// from a given source node to a given target node in an
     4.6    /// edge-weighted directed graph having minimal total weigth (length).
     4.7 -
     4.8 +  ///
     4.9 +  ///\author Attila Bernath
    4.10    template <typename Graph, typename LengthMap>
    4.11    class MinLengthPaths {
    4.12