# HG changeset patch
# User alpar
# Date 1170788957 0
# Node ID 3609c77b77bebb6f98d31db7a59ec9bb72a6da83
# Parent  c43f8802c90ae97269781ca1c99f1e21eda5e868
Doc improvements

diff -r c43f8802c90a -r 3609c77b77be lemon/dijkstra.h
--- a/lemon/dijkstra.h	Thu Jan 25 14:38:55 2007 +0000
+++ b/lemon/dijkstra.h	Tue Feb 06 19:09:17 2007 +0000
@@ -510,6 +510,9 @@
     }
 
   public:
+
+    typedef PredMapPath<Graph, PredMap> Path;
+
     ///\name Execution control
     ///The simplest way to execute the algorithm is to use
     ///one of the member functions called \c run(...).
@@ -719,8 +722,6 @@
     
     ///@{
 
-    typedef PredMapPath<Graph, PredMap> Path;
-
     ///Gives back the shortest path.
     
     ///Gives back the shortest path.
diff -r c43f8802c90a -r 3609c77b77be lemon/kruskal.h
--- a/lemon/kruskal.h	Thu Jan 25 14:38:55 2007 +0000
+++ b/lemon/kruskal.h	Tue Feb 06 19:09:17 2007 +0000
@@ -31,7 +31,6 @@
 ///
 ///Kruskal's algorithm to compute a minimum cost tree.
 ///
-///\todo The file still needs some clean-up.
 
 namespace lemon {
 
@@ -88,15 +87,10 @@
   /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
   /// half of the edges will not be set.
   ///
-  /// \todo Discuss the case of undirected graphs: In this case the algorithm
-  /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some
-  /// people would expect. So, one should be careful not to add both of the
-  /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.
-  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
 
 #ifdef DOXYGEN
   template <class GR, class IN, class OUT>
-  typename IN::value_type::second_type
+  CostType
   kruskal(GR const& g, IN const& in, 
 	  OUT& out)
 #else