equal
  deleted
  inserted
  replaced
  
    
    
    38     /// \brief A skeleton structure for representing directed paths in  | 
    38     /// \brief A skeleton structure for representing directed paths in  | 
    39     /// a digraph.  | 
    39     /// a digraph.  | 
    40     ///  | 
    40     ///  | 
    41     /// A skeleton structure for representing directed paths in a  | 
    41     /// A skeleton structure for representing directed paths in a  | 
    42     /// digraph.    | 
    42     /// digraph.    | 
    43     /// \param _Digraph The digraph type in which the path is.  | 
    43     /// \tparam _Digraph The digraph type in which the path is.  | 
    44     ///  | 
    44     ///  | 
    45     /// In a sense, the path can be treated as a list of arcs. The  | 
    45     /// In a sense, the path can be treated as a list of arcs. The  | 
    46     /// lemon path type stores just this list. As a consequence it  | 
    46     /// lemon path type stores just this list. As a consequence it  | 
    47     /// cannot enumerate the nodes in the path and the zero length  | 
    47     /// cannot enumerate the nodes in the path and the zero length  | 
    48     /// paths cannot store the source.  | 
    48     /// paths cannot store the source.  | 
   203     /// algorithms then we should create a temporarly path object. In  | 
   203     /// algorithms then we should create a temporarly path object. In  | 
   204     /// Lemon such algorithms gives back a path dumper what can  | 
   204     /// Lemon such algorithms gives back a path dumper what can  | 
   205     /// assigned to a real path and the dumpers can be implemented as  | 
   205     /// assigned to a real path and the dumpers can be implemented as  | 
   206     /// an adaptor class to the predecessor map.  | 
   206     /// an adaptor class to the predecessor map.  | 
   207   | 
   207   | 
   208     /// \param _Digraph  The digraph type in which the path is.  | 
   208     /// \tparam _Digraph  The digraph type in which the path is.  | 
   209     ///  | 
   209     ///  | 
   210     /// The paths can be constructed from any path type by a  | 
   210     /// The paths can be constructed from any path type by a  | 
   211     /// template constructor or a template assignment operator.  | 
   211     /// template constructor or a template assignment operator.  | 
   212     ///   | 
   212     ///   | 
   213     template <typename _Digraph>  | 
   213     template <typename _Digraph>  |