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

Timestamp:

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

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Documentation modified

File:

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

lemon/floyd_warshall.h

@@ -143 +143 @@
   };
   
-  /// \brief FloydWarshall algorithm class.
+  /// \brief %FloydWarshall algorithm class.
   ///
   /// \ingroup flowalgs
-  /// This class provides an efficient implementation of \c FloydWarshall 
+  /// This class provides an efficient implementation of \c Floyd-Warshall 
   /// algorithm. The edge lengths are passed to the algorithm using a
   /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
@@ -153 +153 @@
   /// The algorithm solves the shortest path problem for each pairs
   /// of node 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 from each node rather and if the graph is sparse and
-  /// there are negative circles then the johson algorithm.
+  /// there are negative circles then the johnson algorithm.
   ///
   /// The complexity of this algorithm is O(n^3 + e).
@@ -429 +429 @@
     }
 
-    /// \brief Executes the algorithm and checks the negative circles.
+    /// \brief Executes the algorithm and checks the negative cycles.
     ///
     /// This method runs the %FloydWarshall algorithm in order to compute 
-    /// the shortest path to each node pairs. If there is a negative circle 
+    /// the shortest path to each node pairs. If there is a negative cycle 
     /// in the graph it gives back false. 
     /// The algorithm computes