Changeset 1765:f15b3c09481c in lemon-0.x for lemon/belmann_ford.h

Timestamp:

11/04/05 16:00:19 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Removing todos

File:

• lemon/belmann_ford.h (modified) (3 diffs)

lemon/belmann_ford.h

@@ -22 +22 @@
 /// \brief BelmannFord algorithm.
 ///
-/// \todo getPath() should be implemented! (also for BFS and DFS)
 
 #include <lemon/list_graph.h>
@@ -495 +494 @@
     /// If it \c t is a source itself or unreachable, then it does not
     /// alter \c p.
-    /// \todo Is it the right way to handle unreachable nodes?
+    ///
     /// \return Returns \c true if a path to \c t was actually copied to \c p,
     /// \c false otherwise.
@@ -529 +528 @@
     /// \pre \ref run() must be called before using
     /// this function.
-    /// \todo predEdge could be a better name.
     Edge predEdge(Node v) const { return (*_pred)[v]; }