1.1 --- a/src/lemon/graph_wrapper.h	Wed Mar 23 15:43:18 2005 +0000
     1.2 +++ b/src/lemon/graph_wrapper.h	Wed Mar 23 16:59:13 2005 +0000
     1.3 @@ -434,11 +434,11 @@
     1.4    two nodes \c s and \c t. Shortest here means being shortest w.r.t. 
     1.5    non-negative edge-lengths. Note that 
     1.6    the comprehension of the presented solution 
     1.7 -  need's some knowledge from elementary combinatorial optimization. 
     1.8 +  need's some elementary knowledge from combinatorial optimization. 
     1.9  
    1.10    If a single shortest path is to be 
    1.11 -  searched between two nodes \c s and \c t, then this can be done easily by 
    1.12 -  applying the Dijkstra algorithm class. What happens, if a maximum number of 
    1.13 +  searched between \c s and \c t, then this can be done easily by 
    1.14 +  applying the Dijkstra algorithm. What happens, if a maximum number of 
    1.15    edge-disjoint shortest paths is to be computed. It can be proved that an 
    1.16    edge can be in a shortest path if and only if it is tight with respect to 
    1.17    the potential function computed by Dijkstra. Moreover, any path containing 
    1.18 @@ -923,7 +923,8 @@
    1.19    /// But BidirGraphWrapper is obtained from 
    1.20    /// SubBidirGraphWrapper by considering everywhere true 
    1.21    /// valued maps both for forward_filter and backward_filter. 
    1.22 -  /// Finally, one of the most important applications of SubBidirGraphWrapper 
    1.23 +  ///
    1.24 +  /// The most important application of SubBidirGraphWrapper 
    1.25    /// is ResGraphWrapper, which stands for the residual graph in directed 
    1.26    /// flow and circulation problems. 
    1.27    /// As wrappers usually, the SubBidirGraphWrapper implements the