# HG changeset patch
# User alpar
# Date 1083154954 0
# Node ID 02c28d3cf97b096c8e92e098b28492fde0b44106
# Parent  14a1d11ddf211541ba02baa782937edbd2014720
Doxygen options changed.
\author's added.

diff -r 14a1d11ddf21 -r 02c28d3cf97b doc/Doxyfile
--- a/doc/Doxyfile	Wed Apr 28 09:59:23 2004 +0000
+++ b/doc/Doxyfile	Wed Apr 28 12:22:34 2004 +0000
@@ -133,7 +133,7 @@
 # If set to NO, the detailed description appears after the member 
 # documentation.
 
-DETAILS_AT_TOP         = NO
+DETAILS_AT_TOP         = YES
 
 # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented 
 # member inherits the documentation from any documented member that it 
@@ -167,7 +167,7 @@
 # For instance, some of the names that are used will be different. The list 
 # of all members will be omitted, etc.
 
-OPTIMIZE_OUTPUT_FOR_C  = YES
+OPTIMIZE_OUTPUT_FOR_C  = NO
 
 # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources 
 # only. Doxygen will then generate output that is more tailored for Java. 
diff -r 14a1d11ddf21 -r 02c28d3cf97b src/include/dijkstra.h
--- a/src/include/dijkstra.h	Wed Apr 28 09:59:23 2004 +0000
+++ b/src/include/dijkstra.h	Wed Apr 28 12:22:34 2004 +0000
@@ -36,7 +36,8 @@
   ///\param Heap The heap type used by the %Dijkstra
   ///algorithm. The default
   ///is using \ref BinHeap "binary heap".
-  
+  ///
+  ///\author Jacint Szabo
 #ifdef DOXYGEN
   template <typename Graph,
 	    typename LengthMap,
diff -r 14a1d11ddf21 -r 02c28d3cf97b src/include/smart_graph.h
--- a/src/include/smart_graph.h	Wed Apr 28 09:59:23 2004 +0000
+++ b/src/include/smart_graph.h	Wed Apr 28 12:22:34 2004 +0000
@@ -28,6 +28,7 @@
   ///\sa \ref GraphSkeleton.
   ///
   ///\todo Some member functions could be \c static.
+  ///\author Alpar Juttner
   class SmartGraph {
 
     struct NodeT 
diff -r 14a1d11ddf21 -r 02c28d3cf97b src/work/athos/minlengthpaths.h
--- a/src/work/athos/minlengthpaths.h	Wed Apr 28 09:59:23 2004 +0000
+++ b/src/work/athos/minlengthpaths.h	Wed Apr 28 12:22:34 2004 +0000
@@ -25,7 +25,8 @@
   /// an algorithm which finds k edge-disjoint paths
   /// from a given source node to a given target node in an
   /// edge-weighted directed graph having minimal total weigth (length).
-
+  ///
+  ///\author Attila Bernath
   template <typename Graph, typename LengthMap>
   class MinLengthPaths {