Changeset 1754:4bf5ceb49023 in lemon-0.x for lemon/belmann_ford.h

Timestamp:

11/02/05 16:27:38 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Documentation modified

File:

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

lemon/belmann_ford.h

@@ -142 +142 @@
   };
   
-  /// \brief BelmannFord algorithm class.
+  /// \brief %BelmannFord algorithm class.
   ///
   /// \ingroup flowalgs
@@ -152 +152 @@
   /// The Belmann-Ford algorithm solves the shortest path from one node
   /// problem when the edges can have negative length but the graph should
-  /// not contain circle with negative sum of length. If we can assume
+  /// not contain cycles with negative sum of length. If we can assume
   /// that all edge is non-negative in the graph then the dijkstra algorithm
   /// should be used rather.
@@ -429 +429 @@
     }
 
-    /// \brief Executes the algorithm and checks the negative circles.
+    /// \brief Executes the algorithm and checks the negative cycles.
     ///
     /// \pre init() must be called and at least one node should be added
     /// with addSource() before using this function. If there is
-    /// a negative circle in the graph it gives back false.
+    /// a negative cycles in the graph it gives back false.
     ///
     /// This method runs the %BelmannFord algorithm from the root node(s)