diff -r e5c0c5cc477f -r 17eb3eaad9f8 lemon/dag_shortest_path.h
--- a/lemon/dag_shortest_path.h	Thu Feb 02 17:09:09 2006 +0000
+++ b/lemon/dag_shortest_path.h	Thu Feb 02 17:43:24 2006 +0000
@@ -116,7 +116,8 @@
     /// \brief Instantiates a PredMap.
     /// 
     /// This function instantiates a \ref PredMap. 
-    /// \param G is the graph, to which we would like to define the PredMap.
+    /// \param graph is the graph, to which we would
+    /// like to define the PredMap.
     /// \todo The graph alone may be insufficient for the initialization
     static PredMap *createPredMap(const _Graph& graph) {
       return new PredMap(graph);
@@ -133,7 +134,7 @@
     /// \brief Instantiates a DistMap.
     ///
     /// This function instantiates a \ref DistMap. 
-    /// \param G is the graph, to which we would like to define the 
+    /// \param graph is the graph, to which we would like to define the 
     /// \ref DistMap
     static DistMap *createDistMap(const _Graph& graph) {
       return new DistMap(graph);
@@ -227,7 +228,8 @@
     /// \brief Instantiates a PredMap.
     /// 
     /// This function instantiates a \ref PredMap. 
-    /// \param G is the graph, to which we would like to define the PredMap.
+    /// \param graph is the graph,
+    /// to which we would like to define the PredMap.
     /// \todo The graph alone may be insufficient for the initialization
     static PredMap *createPredMap(const _Graph& graph) {
       return new PredMap(graph);
@@ -244,7 +246,7 @@
     /// \brief Instantiates a DistMap.
     ///
     /// This function instantiates a \ref DistMap. 
-    /// \param G is the graph, to which we would like to define the 
+    /// \param graph is the graph, to which we would like to define the 
     /// \ref DistMap
     static DistMap *createDistMap(const _Graph& graph) {
       return new DistMap(graph);
@@ -681,11 +683,11 @@
     /// - The distance of each node from the root.
     ///
     /// \note d.run(s) is just a shortcut of the following code.
-    /// \code
+    ///\code
     ///  d.init();
     ///  d.addSource(s);
     ///  d.start();
-    /// \endcode
+    ///\endcode
     void run(Node s) {
       init();
       addSource(s);
@@ -977,7 +979,7 @@
     /// \brief Runs DagShortestPath algorithm from the given node.
     ///
     /// Runs DagShortestPath algorithm from the given node.
-    /// \param s is the given source.
+    /// \param source is the given source.
     void run(Node source) {
       Base::_source = source;
       run();
@@ -1042,7 +1044,7 @@
     /// \brief Sets the source node, from which the DagShortestPath algorithm runs.
     ///
     /// Sets the source node, from which the DagShortestPath algorithm runs.
-    /// \param s is the source node.
+    /// \param source is the source node.
     DagShortestPathWizard<_Traits>& source(Node source) {
       Base::_source = source;
       return *this;
@@ -1060,9 +1062,9 @@
   /// \ref DagShortestPathWizard.
   /// The following
   /// example shows how to use these parameters.
-  /// \code
+  ///\code
   /// dagShortestPath(g,length,source).predMap(preds).run();
-  /// \endcode
+  ///\endcode
   /// \warning Don't forget to put the \ref DagShortestPathWizard::run() "run()"
   /// to the end of the parameter list.
   /// \sa DagShortestPathWizard