Changeset 785:a9b0863c2265 in lemon-0.x for src/hugo/dijkstra.h

Timestamp:

09/02/04 17:13:21 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1078

Message:

Changes in doc. (New module name for array/vector maps added.)

File:

• src/hugo/dijkstra.h (modified) (4 diffs)

src/hugo/dijkstra.h

@@ -88 +88 @@
     Node source;
 
-    ///Initialize maps
+    ///Initializes the maps.
     
     ///\todo Error if \c G or are \c NULL. What about \c length?
@@ -133 +133 @@
     ///Sets the graph the algorithm will run on.
     ///\return <tt> (*this) </tt>
+    ///\bug What about maps?
+    ///\todo It may be unnecessary
     Dijkstra &setGraph(const Graph &_G) 
     {
@@ -274 +276 @@
 
     ///For a node \c v it returns the 'previous edge' of the shortest path tree,
-    ///i.e. it returns the last edge from a shortest path from the root to \c
+    ///i.e. it returns the last edge of a shortest path from the root to \c
     ///v. It is \ref INVALID
     ///if \c v is unreachable from the root or if \c v=s. The
@@ -323 +325 @@
   };
   
-
-  // **********************************************************************
-  //  IMPLEMENTATIONS
-  // **********************************************************************
-
 /// @}