Changeset 1252:4fee8e9d9014 in lemon-0.x for src/lemon/graph_wrapper.h

Timestamp:

03/23/05 17:59:13 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

documentation

File:

• src/lemon/graph_wrapper.h (modified) (2 diffs)

src/lemon/graph_wrapper.h

@@ -435 +435 @@
   non-negative edge-lengths. Note that 
   the comprehension of the presented solution 
-  need's some knowledge from elementary combinatorial optimization. 
+  need's some elementary knowledge from combinatorial optimization. 
 
   If a single shortest path is to be 
-  searched between two nodes \c s and \c t, then this can be done easily by 
-  applying the Dijkstra algorithm class. What happens, if a maximum number of 
+  searched between \c s and \c t, then this can be done easily by 
+  applying the Dijkstra algorithm. What happens, if a maximum number of 
   edge-disjoint shortest paths is to be computed. It can be proved that an 
   edge can be in a shortest path if and only if it is tight with respect to 
@@ -924 +924 @@
   /// SubBidirGraphWrapper by considering everywhere true 
   /// valued maps both for forward_filter and backward_filter. 
-  /// Finally, one of the most important applications of SubBidirGraphWrapper 
+  ///
+  /// The most important application of SubBidirGraphWrapper 
   /// is ResGraphWrapper, which stands for the residual graph in directed 
   /// flow and circulation problems.