lemon/concepts/path.h
changeset 254 43500afd5cb0
parent 220 a5d8c039f218
child 278 931190050520
child 280 e7f8647ce760
equal deleted inserted replaced
4:02bf34e66850 5:8eba377eeed1
    75       bool empty() const { return true;}
    75       bool empty() const { return true;}
    76 
    76 
    77       /// Resets the path to an empty path.
    77       /// Resets the path to an empty path.
    78       void clear() {}
    78       void clear() {}
    79 
    79 
    80       /// \brief Lemon style iterator for path arcs
    80       /// \brief LEMON style iterator for path arcs
    81       ///
    81       ///
    82       /// This class is used to iterate on the arcs of the paths.
    82       /// This class is used to iterate on the arcs of the paths.
    83       class ArcIt {
    83       class ArcIt {
    84       public:
    84       public:
    85         /// Default constructor
    85         /// Default constructor
   198     ///
   198     ///
   199     /// The main purpose of this concept is that the shortest path
   199     /// The main purpose of this concept is that the shortest path
   200     /// algorithms can enumerate easily the arcs in reverse order.
   200     /// algorithms can enumerate easily the arcs in reverse order.
   201     /// If we would like to give back a real path from these
   201     /// If we would like to give back a real path from these
   202     /// algorithms then we should create a temporarly path object. In
   202     /// algorithms then we should create a temporarly path object. In
   203     /// Lemon such algorithms gives back a path dumper what can
   203     /// LEMON such algorithms gives back a path dumper what can
   204     /// assigned to a real path and the dumpers can be implemented as
   204     /// assigned to a real path and the dumpers can be implemented as
   205     /// an adaptor class to the predecessor map.
   205     /// an adaptor class to the predecessor map.
   206 
   206 
   207     /// \tparam _Digraph  The digraph type in which the path is.
   207     /// \tparam _Digraph  The digraph type in which the path is.
   208     ///
   208     ///
   230       /// is provided in the path dumper. In this case instead of the
   230       /// is provided in the path dumper. In this case instead of the
   231       /// ArcIt the RevArcIt iterator should be implemented in the
   231       /// ArcIt the RevArcIt iterator should be implemented in the
   232       /// dumper.
   232       /// dumper.
   233       typedef False RevPathTag;
   233       typedef False RevPathTag;
   234 
   234 
   235       /// \brief Lemon style iterator for path arcs
   235       /// \brief LEMON style iterator for path arcs
   236       ///
   236       ///
   237       /// This class is used to iterate on the arcs of the paths.
   237       /// This class is used to iterate on the arcs of the paths.
   238       class ArcIt {
   238       class ArcIt {
   239       public:
   239       public:
   240         /// Default constructor
   240         /// Default constructor
   257         /// Comparison operator
   257         /// Comparison operator
   258         bool operator<(const ArcIt&) const {return false;}
   258         bool operator<(const ArcIt&) const {return false;}
   259 
   259 
   260       };
   260       };
   261 
   261 
   262       /// \brief Lemon style iterator for path arcs
   262       /// \brief LEMON style iterator for path arcs
   263       ///
   263       ///
   264       /// This class is used to iterate on the arcs of the paths in
   264       /// This class is used to iterate on the arcs of the paths in
   265       /// reverse direction.
   265       /// reverse direction.
   266       class RevArcIt {
   266       class RevArcIt {
   267       public:
   267       public: